An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

We study the election and the naming problems in the asynchronous message passing model. We present a necessary condition based on Angluin's lifting lemma [1] that must be satisfied by any network that admits a naming (or an election) algorithm. We then show that this necessary condition is also sufficient: we present an election and naming algorithm based on Mazurkiewicz's algorithm [17]. The algorithmwe obtained is totally asynchronous and it needs a polynomial number of messages of polynomial size, whereas previous election algorithms in this model are pseudosynchronous and use messages of exponential size.

[1]  Masafumi Yamashita,et al.  Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct , 1999, IEEE Trans. Parallel Distributed Syst..

[2]  Frank Thomson Leighton,et al.  Finite common coverings of graphs , 1982, J. Comb. Theory, Ser. B.

[3]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[4]  Anca Muscholl,et al.  Characterizations of Classes of Graphs Recognizable by Local Computations , 2004, Theory of Computing Systems.

[5]  Sebastiano Vigna,et al.  Fibrations of graphs , 2002, Discret. Math..

[6]  Yves Métivier,et al.  Termination detection and universal graph reconstruction , 2000, SIROCCO.

[7]  Yves Métivier,et al.  A Characterization of Families of Graphs in Which Election Is Possible , 2002, FoSSaCS.

[8]  ChalopinJérémie,et al.  An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm , 2007 .

[9]  Ran Libeskind-Hadas,et al.  On Multicast Algorithms for Heterogeneous Networks of Workstations , 1989, J. Parallel Distributed Comput..

[10]  Jérémie Chalopin.  Local Computations on Closed Unlabelled Edges: The Election Problem and the Naming Problem , 2005, SOFSEM.

[11]  Andrew S. Tanenbaum,et al.  Distributed systems: Principles and Paradigms , 2001 .

[12]  Masafumi Yamashita,et al.  Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases , 1996, IEEE Trans. Parallel Distributed Syst..

[13]  Sebastiano Vigna,et al.  Symmetry Breaking in Anonymous Networks: Characterizations , 1996, ISTCS.

[14]  Yves Métivier,et al.  Election and Local Computations on Edges , 2004, FoSSaCS.

[15]  Sape Mullender,et al.  Distributed systems , 1989 .

[16]  Hans L. Bodlaender,et al.  The Classification of Coverings of Processor Networks , 1989, J. Parallel Distributed Comput..

[17]  Yves Métivier,et al.  Election, Naming and Cellular Edge Local Computations , 2004, ICGT.

[18]  Yves Métivier,et al.  About the Termination Detection in the Asynchronous Message Passing Model , 2007, SOFSEM.

[19]  Antoni W. Mazurkiewicz.  Distributed Enumeration , 1997, Inf. Process. Lett..

[20]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[21]  Yves Métivier,et al.  A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs , 2005, MFCS.

[22]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[23]  Nancy Norris,et al.  Universal Covers of Graphs: Isomorphism to Depth N-1 Implies Isomorphism to All Depths , 1995, Discret. Appl. Math..

[24]  Boleslaw K. Szymanski,et al.  Terminating iterative solution of simultaneous equations in distributed message passing systems , 1985, PODC '85.

[25]  Gérard Le Lann,et al.  Distributed Systems - Towards a Formal Approach , 1977, IFIP Congress.

[26]  Antoni W. Mazurkiewicz.  Bilateral Ranking Negotiations , 2004, Fundam. Informaticae.

[27]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .

[28]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[29]  Dana Angluin,et al.  Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.