Skip to main content
SpringerLink
Log in

On the power of synchronization between two adjacent processes

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We study the power of local computations on labelled edges (which allow two adjacent vertices to synchronize and to modify their states simultaneaously in function of their previous states) through the classical election problem. We characterize the graphs for which this problem has a solution. As corollaries we characterize graphs which admit an election algorithm for two seminal models: Angluin’s model and asynchronous systems where processes communicate with synchronous message passing (i.e., there is a synchronization between the process sending the message and the one receiving it).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Angluin D., Aspnes J., Diamadi Z., Fisher M.J., Peralta R.: Computation in networks of passively mobile finite-state sensors. Distr. Comput. 18(4), 235–253 (2006)

    Article  Google Scholar 

  2. Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: On the power of anonymous one-way communication. In: Proceedings of 9th Conference on Principles of Distributed Computing, pp. 307–318 (2005)

  3. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th Symposium on Theory of Computing, pp. 82–93 (1980)

  4. Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Middleware for Network Eccentric and Mobile Applications, pp. 97–119. Springer, Berlin (2009)

  5. Boldi, P., Codenotti, B., Gemmell, P., Shammah, S., Simon, J., Vigna, S.: Symmetry breaking in anonymous networks: Characterizations. In: Proceedings of 4th Israeli Symposium on Theory of Computing and Systems, pp. 16–26. IEEE Press (1996)

  6. Chalopin, J.: Local computations on closed unlabelled edges: The election problem and the naming problem. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005), vol. 3381 of Lecture Notes in Computer Science, pp. 81–90. Springer, Berlin (2005)

  7. Chalopin, J., Métivier, Y.: Election and local computations on edges. In: Proceedings of Foundations of Software Science and Computation Structures, 7th International Conference (FOSSACS 2004), vol. 2987 of Lecture Notes in Computer Science, pp. 90–104. Springer, Berlin (2004)

  8. Chalopin J., Métivier Y.: An efficient message passing election algorithm based on mazurkiewicz’s algorithm. Fundam. Inf. 80(1-3), 221–246 (2007)

    MATH  Google Scholar 

  9. Chalopin J., Métivier Y., Zielonka W.: Local computations in graphs: The case of cellular edge local computations. Fundam. Inf. 74(1), 85–114 (2006)

    MATH  Google Scholar 

  10. Chalopin, J., Paulusma, D.: Graph labelings derived from models in distributed computing. In: WG, pp. 301–312 (2006)

  11. Dolev D., Dwork C., Stockmeyer L.J.: On the minimal synchronism needed for distributed consensus. J. ACM 34(1), 77–97 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fiala J., Paulusma D.: A complete complexity classification of the role assignement problem. Theor. Comput. Sci. 349, 67–81 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Fiala J., Paulusma D., Telle J.A.: Locally constrained graph homomorphisms and equitable partitions. Eur. J. Comb. 29(4), 850–880 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Ghosh S.: Distributed systems—an algorithmic approach. Chapman and Hall/CRC, London (2006)

    Book  Google Scholar 

  15. Godard, E., Métivier, Y.: A characterization of families of graphs in which election is possible (ext. abstract). In Nielsen, M., Engberg, U. (eds), Proceedings of Foundations of Software Science and Computation Structures, FOSSACS’02, number 2303 in LNCS, pp. 159–171. Springer, Berlin (2002)

  16. Godard E., Métivier Y., Muscholl A.: Characterization of classes of graphs recognizable by local computations. Theory Comput. Syst. 37(2), 249–293 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  17. Godard E.: A self-stabilizing enumeration algorithm. Inf. Process. Lett. 82(6), 299–305 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hoare C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666–677 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  19. Mazurkiewicz, A.: Trace theory. In: Brauer, W. et al., (eds.) Petri nets, applications and relationship to other models of concurrency. vol. 255 of Lecture notes in computer science, pp. 279–324. Springer, Berlin (1987)

  20. Mazurkiewicz A.: Distributed enumeration. Inf. Process. Lett. 61, 233–239 (1997)

    Article  MathSciNet  Google Scholar 

  21. Mazurkiewicz A.: Bilateral ranking negotiations. Fundam. Inf. 60(1–4), 1–16 (2004)

    MATH  MathSciNet  Google Scholar 

  22. Milne G., Milner R.: Concurrent processes and their syntax. J. ACM 26(2), 302–321 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  23. Métivier, Y., Tel, G.: Termination detection and universal graph reconstruction. In SIROCCO 00—7th International Colloquium on Structural Information & Communication Complexity, pp. 237–251 (2000)

  24. Reidemeister K.: Einführung in die Kombinatorische Topologie. Vieweg, Brunswick (1932)

    Google Scholar 

  25. Rosen, K.H. (eds): Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton (2000)

    MATH  Google Scholar 

  26. Tanenbaum A., van Steen M.: Distributed systems—principles and paradigms. Prentice Hall, London (2002)

    MATH  Google Scholar 

  27. Tel G.: Introduction to distributed algorithms. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  28. 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)

    Article  Google Scholar 

  29. Yamashita M., Kameda T.: Leader election problem on networks in which processor identity numbers are not distinct. IEEE Trans. Parallel Distrib. Syst. 10(9), 878–887 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIF, CNRS & Aix Marseille Université, 39 rue Joliot-Curie, 13453, Marseille, France

    Jérémie Chalopin

  2. Université de Bordeaux, LaBRI UMR CNRS 5800, 351 cours de la Libération, 33405, Talence, France

    Yves Métivier

Authors
  1. Jérémie Chalopin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Métivier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yves Métivier.

Additional information

This work was supported by grant No ANR-06-SETI-015-03 awarded by Agence Nationale de la Recherche.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chalopin, J., Métivier, Y. On the power of synchronization between two adjacent processes. Distrib. Comput. 23, 177–196 (2010). https://doi.org/10.1007/s00446-010-0115-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-010-0115-3

Keywords

Search

Navigation