How to elect a leader faster than a tournament

D. Alistarh, R. Gelashvili, A. Vladu, in:, ACM, 2015, pp. 365–374.


Conference Paper | Published
Author
; ;
Abstract
The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than just running a Θ(log n)-time tournament, against a strong adaptive adversary? In this paper, we answer this question in the affirmative, improving on a decades-old upper bound. We introduce two new algorithmic ideas to reduce the time complexity of electing a leader to O(log∗ n), using O(n2) point-to-point messages. A non-trivial application of our algorithm is a new upper bound for the tight renaming problem, assigning n items to the n participants in expected O(log2 n) time and O(n2) messages. We complement our results with lower bound of Ω(n2) messages for solving these two problems, closing the question of their message complexity.
Publishing Year
Date Published
2015-07-21
Acknowledgement
Support is gratefully acknowledged from the National Science Foundation under grants CCF-1217921, CCF-1301926, and IIS-1447786, the Department of Energy under grant ER26116/DE-SC0008923, and the Oracle and Intel corporations. The authors would like to thank Prof. Nir Shavit for ad- vice and encouragement during this work, and the anonymous reviewers for their very useful suggestions.
Volume
2015-July
Page
365 - 374
Conference
PODC: Principles of Distributed Computing
IST-REx-ID

Cite this

Alistarh D, Gelashvili R, Vladu A. How to elect a leader faster than a tournament. In: Vol 2015-July. ACM; 2015:365-374. doi:10.1145/2767386.2767420
Alistarh, D., Gelashvili, R., & Vladu, A. (2015). How to elect a leader faster than a tournament (Vol. 2015–July, pp. 365–374). Presented at the PODC: Principles of Distributed Computing, ACM. https://doi.org/10.1145/2767386.2767420
Alistarh, Dan, Rati Gelashvili, and Adrian Vladu. “How to Elect a Leader Faster than a Tournament,” 2015–July:365–74. ACM, 2015. https://doi.org/10.1145/2767386.2767420.
D. Alistarh, R. Gelashvili, and A. Vladu, “How to elect a leader faster than a tournament,” presented at the PODC: Principles of Distributed Computing, 2015, vol. 2015–July, pp. 365–374.
Alistarh D, Gelashvili R, Vladu A. 2015. How to elect a leader faster than a tournament. PODC: Principles of Distributed Computing vol. 2015–July. 365–374.
Alistarh, Dan, et al. How to Elect a Leader Faster than a Tournament. Vol. 2015–July, ACM, 2015, pp. 365–74, doi:10.1145/2767386.2767420.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar