Abstract
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite, no deterministic solutions exist, because it is impossible to break symmetry.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Abrahamson, A. Adler, R. Gelbart, L. Higham, and D. Kirkpartrick: The bit complexity of randomized leader election on a ring. SIAM J. Comput. 18 (1989) 12–29
Dana Angluin: Local and global properties in networks of processors. 12th ACM Symposium on the Theory of Computing. (1980) 82–93
Hagit Attiya and Jennifer Welch: Distributed Computing, Fundamentals, Simulations and Advanced Topics. McGraw-Hill. (1998)
J. Beauquier, M. Gradinariu, and C. Johnen: Memory space requirements for selfstabilizing leader election protocols. Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing. (1999) 199–208
J. Beauquier, M. Gradinariu, and C. Johnen: Self-stabilizing and space optimal leader election under arbitrary scheduler on rings. Internal Report, LRI, Université de Paris-Sud, France. (1999)
J. Beauquier, M. Gradinariu, and C. Johnen: Cross-over composition-enforcement of fairness under unfair adversary. Fifth Workshop on Self-Stabilizing Systems. (2001)
J.E. Burns and J. Pachl: Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems. 11 (1989) 330–344
S. Dolev, M.G. Gouda, and M. Schneider: Memory requirements for silent stabilization. Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing. (1996) 27–34
E.W. Dijkstra: Self stabilizing systems in spite of distributed control. CACM 17 (1974) 643–644
E.W. Dijkstra: Self stabilizing systems in spite of distributed control. Selected Writing on Computing: A Personal Perspective. Springer-Verlag. (1982) 41–46
E.W. Dijkstra: A belated proof of self-stabilization. Distributed Computing. 1 (1986) 5–6
Shlomi Dolev: Self-Stabilization. MIT Press. (2000)
M.G. Gouda and F.F. Haddix: The stabilizing token ring in three bits. Journal of Parallel and Distributed Computing. 35 (1996) 43–48
Ted Herman: Comprehensive self-stabilization bibliography. http://www.cs.uiowa.edu/ftp/selfstab/bibliography/ (2001)
L. Higham and S. Myers: Self-stabilizing token circulation on anonymous message passing. Distributed Computing: OPODIS’ 98. Hermes. (1998) 115–128
S.T. Huang: Leader election in uniform rings. ACM Transactions on Programming Languages and Systems. 15 (1993) 563–573
G. Itkis, C. Lin, and J. Simon: Deterministic, constant space, self-stabilizing leader election on uniform rings. Proceedings of the 9th International Workshop on Distributed Algorithms, Lecture Notes in Computer Science. Springer-Verlag. 972 (1995) 288–302
C. Lin and J. Simon: Observing self-stabilization. Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing. (1992) 113–123
Nancy Lynch: Distributed Algorithms. Morgan Kaufmann. (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fich, F.E., Johnen, C. (2001). A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings. In: Welch, J. (eds) Distributed Computing. DISC 2001. Lecture Notes in Computer Science, vol 2180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45414-4_16
Download citation
DOI: https://doi.org/10.1007/3-540-45414-4_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42605-9
Online ISBN: 978-3-540-45414-4
eBook Packages: Springer Book Archive