Electing a leader in a synchronous ring

Authors:
Greg N. Frederickson;Nancy A. Lynch
Affiliations:
Purdue Univ., West Lafayette, IN;Massachusetts Institute of Technology, Cambridge
Venue:
Journal of the ACM (JACM)
Year:
1987

Citing 11
Cited 42

Applications of Ramsey's theorem to decision tree complexity

Journal of the ACM (JACM)
Should Tables Be Sorted?

Journal of the ACM (JACM)
Computing on an anonymous ring

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
Decentralized extrema-finding in circular configurations of processors

Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes

Communications of the ACM
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The impact of synchronous communication on the problem of electing a leader in a ring

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Distributed elections in an archimedean ring of processors

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Graphs and Hypergraphs

Graphs and Hypergraphs

Computing on an anonymous ring

Journal of the ACM (JACM)
A hundred impossibility proofs for distributed computing

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Lower bounds for wait-free computation in message-passing systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilizing symmetry breaking in constant-space (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Distributed algorithms for locating centers and medians in communication networks

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Generalized FLP impossibility result for t-resilient asynchronous computations

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
What can be computed locally?

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Consensus power makes (some) sense! (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases

IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing algorithms for synchronous unidirectional rings

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct

IEEE Transactions on Parallel and Distributed Systems
Information Dissemination in Distributed Systems with Faulty Units

IEEE Transactions on Computers
Dynamic Synchrony Among Atomic Actions

IEEE Transactions on Parallel and Distributed Systems
Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Leader election in rings with nonunique labels

Fundamenta Informaticae
On the complexity of global computation in the presence of link failures: the general case

Distributed Computing
Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links

Distributed Computing
Towards a theory of "local to global" in distributed multi-agent systems (II)

Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Simulation of a Novel Leader Election Protocol with the Use of Petri Nets

DS-RT '05 Proceedings of the 9th IEEE International Symposium on Distributed Simulation and Real-Time Applications
Improving OSPF Dynamics on a Broadcast LAN

Simulation
Move-optimal gossiping among mobile agents

Theoretical Computer Science
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm

SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Modified bully election algorithm in distributed systems

ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Energy-optimal distributed algorithms for minimum spanning trees

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Optimal moves for gossiping among mobile agents

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Note: Strong order-preserving renaming in the synchronous message passing model

Theoretical Computer Science
How much memory is needed for leader election

DISC'10 Proceedings of the 24th international conference on Distributed computing
Cellular automata evolution of leader election

ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part II
Trading bit, message, and time complexity of distributed algorithms

DISC'11 Proceedings of the 25th international conference on Distributed computing
Read-write reductions

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Exact Quantum Algorithms for the Leader Election Problem

ACM Transactions on Computation Theory (TOCT)
Distributed tree comparison with nodes of limited memory

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Group leader election under link-state routing

Computer Communications
Leader Election in Rings with Nonunique Labels

Fundamenta Informaticae
Distributed tree comparison with nodes of limited memory

Networks
Knowledge, level of symmetry, and time of leader election

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Byzantine renaming in synchronous systems with t

Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the complexity of universal leader election

Proceedings of the 2013 ACM symposium on Principles of distributed computing
Learning a ring cheaply and fast

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Computing with infinitely many processes

Information and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of electing a leader in a synchronous ring of n processors is considered. Both positive and negative results are obtained. On the one hand, if processor IDS are chosen from some countable set, then there is an algorithm that uses only O(n) messages in the worst case. On the other hand, any algorithm that is restricted to use only comparisons of IDs requires &OHgr;(n log n) messages in the worst case. Alternatively, if the number of rounds is required to be bounded by some t in the worst case, and IDs are chosen from any set having at least ƒ(n, t) elements, for a certain very fast-growing function ƒ, then any algorithm requires &OHgr;(n log n) messages in the worst case.