Advertisement

A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs

  • Jérémie Chalopin
  • Yves Métivier
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3618)

Abstract

A distributed system is a collection of processes that can interact. Three major process interaction models in distributed systems have principally been considered: – the message passing model, – the shared memory model, – the local computation model. In each model the processes are represented by vertices of a graph and the interactions are represented by edges. In the message passing model and the shared memory model, processes interact by communication primitives: messages can be sent along edges or atomic read/write operations can be performed on registers associated with edges. In the local computation model interactions are defined by labelled graph rewriting rules; supports of rules are edges or stars. These models (and their sub-models) reflect different system architectures, different levels of synchronization and different levels of abstraction. Understanding the power of various models, the role of structural network properties and the role of the initial knowledge enhances our understanding of basic distributed algorithms. This is done with some typical problems in distributed computing: election, naming, spanning tree construction, termination detection, network topology recognition, consensus, mutual exclusion. Furthermore, solutions to these problems constitute primitive building blocks for many other distributed algorithms. A survey may be found in [FR03], this survey presents some links with several parameters of the models including synchrony, communication media and randomization. An important goal in the study of these models is to understand some relationships between them. This paper is a contribution to this goal; more precisely we establish a bridge between tools and results presented in [YK96] for the message passing model and tools and results presented in [Ang80, BCG+96, Maz97, CM04, CMZ04, Cha05] for the local computation model.

Keywords

Local Computation Label Graph Naming Algorithm Local View Election Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ang80]
    Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)Google Scholar
  2. [AW98]
    Attiya, H., Welch, J.: Distributed computing: fundamentals, simulations, and advanced topics. McGraw-Hill, New York (1998)Google Scholar
  3. [BCG+96]
    Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proc. 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Computer Society Press, Los Alamitos (1996)Google Scholar
  4. [BV99]
    Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of the 18th ACM Symposium on principles of distributed computing, pp. 181–188. ACM Press, New York (1999)Google Scholar
  5. [BV01]
    Boldi, P., Vigna, S.: An effective characterization of computability in anonymous networks. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 33–47. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. [BV02]
    Boldi, P., Vigna, S.: Fibrations of graphs. Discrete Math. 243, 21–66 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  7. [Cha05]
    Chalopin, J.: Election and local computations on closed unlabelled edges (extended abstract). In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 81–90. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. [CM04]
    Chalopin, J., Métivier, Y.: Election and local computations on edges. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 90–104. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. [CMZ04]
    Chalopin, J., Métivier, Y., Zielonka, W.: Election, naming and cellular edge local computations. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 242–256. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. [FR03]
    Fich, F., Ruppert, E.: Hundreds of impossibility results for distributed computing. distributed computing 16, 121–163 (2003)CrossRefGoogle Scholar
  11. [GMM04]
    Godard, E., Métivier, Y., Muscholl, A.: Characterization of Classes of Graphs Recognizable by Local Computations. Theory of Computing Systems (37), 249–293 (2004)Google Scholar
  12. [LeL77]
    LeLann, G.: Distributed systems: Towards a formal approach. In: Gilchrist, B. (ed.) Information processing 1977, pp. 155–160. North-Holland, Amsterdam (1977)Google Scholar
  13. [Maz97]
    Mazurkiewicz, A.: Distributed enumeration. Inf. Processing Letters 61, 233–239 (1997)CrossRefMathSciNetGoogle Scholar
  14. [RFH72]
    Rosenstiehl, P., Fiksel, J.-R., Holliger, A.: Intelligent graphs. In: Read, R. (ed.) Graph theory and computing, pp. 219–265. Academic Press, New York (1972)Google Scholar
  15. [Tel00]
    Tel, G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)zbMATHGoogle Scholar
  16. [YK96]
    Yamashita, M., Kameda, T.: Computing on anonymous networks: Part i - characterizing the solvable cases. IEEE Transactions on parallel and distributed systems 7(1), 69–89 (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jérémie Chalopin
    • 1
  • Yves Métivier
    • 1
  1. 1.LaBRI Université Bordeaux 1, ENSEIRBTalenceFrance

Personalised recommendations