Skip to main content
SpringerLink
Log in
SpringerLink
Log in

A Space Optimal, Deterministic, Self-stabilizing, Leader Election Algorithm for Unidirectional Rings

  • Conference paper
  • First Online:
Distributed Computing (DISC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2180))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

    Article  MATH  MathSciNet  Google Scholar 

  2. Dana Angluin: Local and global properties in networks of processors. 12th ACM Symposium on the Theory of Computing. (1980) 82–93

    Google Scholar 

  3. Hagit Attiya and Jennifer Welch: Distributed Computing, Fundamentals, Simulations and Advanced Topics. McGraw-Hill. (1998)

    Google Scholar 

  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

    Google Scholar 

  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)

    Google Scholar 

  6. J. Beauquier, M. Gradinariu, and C. Johnen: Cross-over composition-enforcement of fairness under unfair adversary. Fifth Workshop on Self-Stabilizing Systems. (2001)

    Google Scholar 

  7. J.E. Burns and J. Pachl: Uniform self-stabilizing rings. ACM Transactions on Programming Languages and Systems. 11 (1989) 330–344

    Article  Google Scholar 

  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

    Google Scholar 

  9. E.W. Dijkstra: Self stabilizing systems in spite of distributed control. CACM 17 (1974) 643–644

    MATH  Google Scholar 

  10. E.W. Dijkstra: Self stabilizing systems in spite of distributed control. Selected Writing on Computing: A Personal Perspective. Springer-Verlag. (1982) 41–46

    Google Scholar 

  11. E.W. Dijkstra: A belated proof of self-stabilization. Distributed Computing. 1 (1986) 5–6

    Article  MATH  Google Scholar 

  12. Shlomi Dolev: Self-Stabilization. MIT Press. (2000)

    Google Scholar 

  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

    Article  MATH  Google Scholar 

  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

    Google Scholar 

  16. S.T. Huang: Leader election in uniform rings. ACM Transactions on Programming Languages and Systems. 15 (1993) 563–573

    Article  Google Scholar 

  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

    Google Scholar 

  18. C. Lin and J. Simon: Observing self-stabilization. Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing. (1992) 113–123

    Google Scholar 

  19. Nancy Lynch: Distributed Algorithms. Morgan Kaufmann. (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, Canada

    Faith E. Fich

  2. Laboratoire de Recherche en Informatique, CNRS—Université de Paris-Sud, France

    Colette Johnen

Authors
  1. Faith E. Fich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colette Johnen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas A&M University, College Station, TX, 77843-3112, USA

    Jennifer Welch

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation