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

Authors:
Jérémie Chalopin;Yves Métivier
Affiliations:
LaBRI Université de Bordeaux, France. E-mail: {chalopin,metivier}@labri.fr;LaBRI Université de Bordeaux, France. E-mail: {chalopin,metivier}@labri.fr
Venue:
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Year:
2007

Citing 17
Cited 1

The classification of coverings of processor networks

Journal of Parallel and Distributed Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases

IEEE Transactions on Parallel and Distributed Systems
Distributed enumeration

Information Processing Letters
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct

IEEE Transactions on Parallel and Distributed Systems
Terminating iterative solution of simultaneous equations in distributed message passing systems

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Fibrations of graphs

Discrete Mathematics
Introduction to Distributed Algorithms

Introduction to Distributed Algorithms
Distributed Algorithms

Distributed Algorithms
Distributed Systems: Principles and Paradigms

Distributed Systems: Principles and Paradigms
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Characterization of Families of Graphs in Which Election Is Possible

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
About the Termination Detection in the Asynchronous Message Passing Model

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Local computations on closed unlabelled edges: the election problem and the naming problem

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
A bridge between the asynchronous message passing model and local computations in graphs

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Bilateral Ranking Negotiations

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)

Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.