Uniform dynamic self-stabilizing leader election

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 4, 1997, Pages 424-440

  Dolev, Shlomi ^a   Israeli, Amos ^b   Moran, Shlomo ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b INTEL CORPORATION   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed algorithms; Leader election; Randomized distributed algorithms; Self stabilizing systems; Synchronization

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROGRAM PROCESSORS; SYNCHRONIZATION;

LEADER ELECTION ALGORITHMS; UNIFORMLY DYNAMIC SELF STABILIZING PROTOCOLS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031118863     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.588622     Document Type: Article

References (32)

1. K. Abrahamson, A. Adler, L. Higham, and D. Kirkpatrick, "Probabilistic Solitude Verification on a Ring," Proc. Fifth Ann. ACM Symp. Principles of Distributed Computing, Quebec City, pp. 161-173, Aug. 1986.
2. H. Attiya, M. Snir, and M. Warmuth, "Computing on an Anonymous Ring," J. ACM, vol. 35, no. 4, pp. 845-875, Oct. 1988.
3. K. Abrahamson, "On Achieving Consensus Using a Shared Memory," Proc. Seventh Ann. ACM Symp. Principles of Distributed Computing, pp. 291-302, Toronto, Canada, Aug. 1988.
4. E. Angnostou and R. El-Yaniv, "More on the Power of Random Walks: Uniform Self-Stabilizing Algorithms," Lecture Notes in Computer Science 579: Distributed Algorithms, Proc. Fifth Int'l Workshop Distributed Algorithms, S. Toueg, P.G. Spirakis, and L. Kirousis, eds, Delphi, Greece, pp. 31-51, Oct. 1991. Springer-Verlag, 1992.
5. A. Arora and M. Gouda, "Distributed Reset," Lecture Notes Computer Science 472: Foundations of Software Technology and Theoretical Computer Science, Proc. 10th Conf. Foundations of Software Technology and Theoretical Computer Science, K.V. Nori and C.E. Veni Madhavan, eds., pp. 316-331, Dec. 1990. Springer-Verlag, 1990.
6. Y. Afek, S. Kutten, and M. Yung, "Memory-Efficient Self-Stabilization on General Networks," Lecture Notes in Computer Science 486: Distributed Algorithms, Proc. Fourth Int'l Workshop Distributed Algorithms, J. Van Leeuwen and N. Santoro, eds, pp. 15-28. Springer-Verlag, 1991.
7. Y. Afek, S. Kutten and M. Yung, "Local Detection for Global Self-Stabilization," preprint.
8. B. Awerbuch and G. Varghese, "Distributed Program Checking a Paradigm for Building Self-Stabilizing Distributed Protocols," Proc. 31st Ann. IEEE Symp. Foundations of Computer Science, pp. 268-277, 1991.
9. B. Awerbuch, "Complexity of Network Synchronization," J. ACM, vol. 32, no. 4, pp. 804-823, 1985.
10. G.M. Brown, M.G. Gouda, and C.L. Wu, "A Self-Stabilizing Token System," Proc. 20th Ann. Hawaii Int'l Conf. System Sciences, pp. 218-223, 1987.
11. J.E. Burns and J. Pachl, "Uniform Self-Stabilizing Rings," ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330-344, Apr. 1989.
12. J.E. Burns, "Self-Stabilizing Rings Without Demons," Technical Report GIT-ICS-8736, Georgia Inst. of Technology.
13. B.S. Chlebus, K. Diks, and A. Pelc, "Fast Gossiping With Short Unreliable Messages," Discrete Applied Math., special issue on gossiping, vol. 53, pp. 15-24, 1994.
14. E.W. Dijkstra, "Self-Stabilizing Systems in Spite of Distributed Control," Comm. ACM vol. 17, no. 11, pp. 643-644, 1974.
15. S. Dolev, A. Israeli, and S. Moran, "Self Stabilization of Dynamic Systems," Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing, Quebec City, pp. 103-118, Aug. 1990.
16. Distributed Computting vol. 7, pp. 3-16, 1993.
17. S. Dolev, A. Israeli, and S. Moran, "Uniform Dynamic Self-Stabilizing Leader Election," in Lecture Notes in Computer Science 579: Distributed Algorithms, Proc. Fifth Int'l Workshop on Distributed Algorithms, Delphi, Greece, S. Toueg, P.G. Spirakis and L. Kirousis, eds., pp. 163-180, Oct. 1991. Springer-Verlag, 1992.
18. S. Dolev, A. Israeli, and S. Moran, "Analyzing Expected Time by Scheduler-Luck Games," IEEE Trans. Software Eng., vol. 21, no. 5, pp. 429-439, May 1995.
19. R. G. Gallager, "Finding a Leader in Networks With O(E) + O(N log N) Messages," Internal Memo., M.I.T., Cambridge, Mass., 1978.
20. S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, "A Survey of Gossiping and Broadcasting in Comm. Networks," Networks, vol. 18, pp. 319-349, 1988.
21. P. Humblet, "Selecting a Leader in a Clique in O(N log n) Messages. Internal Memo., Laboratory for Information and Decision Systems, M.I.T., Cambridge, Mass., 1984.
22. A. Israeli and M. Jalfon, "Token Management Schemes and Random Walks Yield Self Stabilizing Mutual Exclusion," Proc. Ninth Ann. ACM Symp. Principles of Distributed Computation, Quebec City, pp. 119-132, Aug. 1990.
23. A. Israeli and M. Jalfon, "Self Stabilizing Ring Orientation," Lecture Notes in Computer Science 486: Distributed Algorithms (Proc. Fourth Int'l Workshop on Distributed Algorithms, Bari, Italy, J. Van Leeuwen and N. Santoro, eds, pp. 1-14, Sept. 1990. Springer-Verlag, 1991.
24. A. Itai and M. Rodeh, "Probabilistic Methods for Breaking Symmetry in Distributed Networks," Information and Computation, vol. 88, no. 1, pp. 60-87, 1990.
25. E. Korach, S. Kutten, and S. Moran, "A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms," ACM Trans. Programming Languages and Systems, vol. 12, no. 1, pp. 84-101, 1990.
26. E. Korach, S. Moran, and S. Zaks, "Tight Lower and Upper Bounds for Some Distributed Algorithms for Complete Network of Processors," Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 199-207, 1984.
27. S. Katz and K.J. Perry, "Self-Stabilizing Extensions for Message-Passing Systems," Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing, Quebec City, pp. 91-101, Aug. 1990.
28. L. Lamport, "The Mutual Exclusion Problem: Part II - Statement and Solutions," J. ACM, vol. 33, no. 2, pp. 327-348, 1986.
29. Y. Matias and Y. Afek, "Simple and Efficient Election Algorithms for Anonymous Networks," manuscript, 1989.
30. A. Segall, "Distributed Networks Protocols," IEEE Trans. Comm., vol. 29, no. 1, pp. 23-35, Jan. 1983.
31. B. Schieber and M. Snir, "Calling Names on Nameless Networks," Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing, Edmonton, pp. 319-328, Aug. 1989.
32. M. Tchuente, "Sur l'auto-stabilisation dans un réseau d'ordinateurs," RAIRO Inf. Theor., vol. 15, pp. 47-66, 1981.