A space optimal, deterministic, self-stabilizing, leader election algorithm for unidirectional rings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2180, Issue , 2001, Pages 224-239

  Fich, Faith E ^a   Johnen, Colette ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LEADER ELECTION ALGORITHM; PRIME SIZE; RING SIZES; SELF-STABILIZING ALGORITHM; SPACE COMPLEXITY; UNIDIRECTIONAL RINGS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84957022096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45414-4_16     Document Type: Conference Paper

References (19)

1. 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
2. Dana Angluin: Local and global properties in networks of processors. 12th ACM Symposium on the Theory of Computing. (1980) 82–93
3. Hagit Attiya and Jennifer Welch: Distributed Computing, Fundamentals, Simulations and Advanced Topics. McGraw-Hill. (1998)
4. 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
5. 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)
6. J. Beauquier, M. Gradinariu, and C. Johnen: Cross-over composition–enforcement of fairness under unfair adversary. Fifth Workshop on Self-Stabilizing Systems. (2001)
7. J.E. Burns and J. Pachl: Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems. 11 (1989) 330–344
8. 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
9. E.W. Dijkstra: Self stabilizing systems in spite of distributed control. CACM 17 (1974) 643–644
10. E.W. Dijkstra: Self stabilizing systems in spite of distributed control. Selected Writing on Computing: A Personal Perspective. Springer-Verlag. (1982) 41–46
11. E.W. Dijkstra: A belated proof of self-stabilization. Distributed Computing. 1 (1986) 5–6
12. Shlomi Dolev: Self-Stabilization. MIT Press. (2000)
13. M.G. Gouda and F.F. Haddix: The stabilizing token ring in three bits. Journal of Parallel and Distributed Computing. 35 (1996) 43–48
14. Ted Herman: Comprehensive self-stabilization bibliography. http://www.cs.uiowa.edu/ftp/selfstab/bibliography/ (2001)
15. L. Higham and S. Myers: Self-stabilizing token circulation on anonymous message passing. Distributed Computing: OPODIS’98. Hermes. (1998) 115–128
16. S.T. Huang: Leader election in uniform rings. ACM Transactions on Programming Languages and Systems. 15 (1993) 563–573
17. 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
18. C. Lin and J. Simon: Observing self-stabilization. Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing. (1992) 113–123
19. Nancy Lynch: Distributed Algorithms. Morgan Kaufmann. (1996)