Affiliation:
1. Purdue Univ., West Lafayette, IN
2. Massachusetts Institute of Technology, Cambridge
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 Ω(
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 Ω(
n
log
n
) messages in the worst case.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
102 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Brief Announcement: Content-Oblivious Leader Election on Rings;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17
2. Raft Protocol for Fault Tolerance and Self-Recovery in Federated Learning;Proceedings of the 19th International Symposium on Software Engineering for Adaptive and Self-Managing Systems;2024-04-15
3. Leader Election in a Distributed CAN-Based Multi-Microcontroller System;2023 3rd International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME);2023-07-19
4. Improved Tradeoffs for Leader Election;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16
5. Four shades of deterministic leader election in anonymous networks;Distributed Computing;2023-05-31