Advertisement

Distributed Computing

, Volume 6, Issue 2, pp 95–98 | Cite as

Self-stabilization: randomness to reduce space

  • Ted Herman
Article

Summary

It is shown that Dijkstra'sk-state self-stabilizing protocol for mutual exclusion in a unidirectional ring can be converted to a 3-state protocol by replacing a counter with a random number generator.

Key words

Self-stabilization Probabilistic protocols Mutual exclusion 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dijkstra EW: Self-stabilizing systems in spite of distributed control. Commun ACM 17:643–644 (1974)CrossRefGoogle Scholar
  2. 2.
    Dijkstra EW: EWD 391 self-stabilization in spite of distributed control. In: Dijkstra EW (ed) Selected writings on computing: a personal perspective. Springer, Berlin Heidelberg New York 1982Google Scholar
  3. 3.
    Herman T: Probabilistic self-stabilization. Inf. Process. Lett. 35:63–67 (1990)CrossRefGoogle Scholar
  4. 4.
    Israeli A, Jalfon M: Token-management schemes and random walks yield self-stabilizing mutual exclusion. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing pp 119–131, 1990Google Scholar

Copyright information

© Springer-Verlag 1992

Authors and Affiliations

  • Ted Herman
    • 1
  1. 1.Department of Computer SciencesUniversity of Texas at AustinAustinUSA

Personalised recommendations