Advertisement

Uniform self-stabilizing rings

  • James E. Burns
  • Jan Pachl
Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 319)

Abstract

A self-stabilizing system has the property that it eventually reaches a legitimate configuration when started in any arbitrary configuration. Dijkstra originally introduced the self-stabilization problem and gave several solutions for a ring of processors [Dij74]. His solutions, and others that have appeared, use a distinguished processor in the ring, which can help to drive the system toward stability. Dijkstra observed that a distinguished processor is essential if the number of processors in the ring is composite [Dij82]. We show that there is a self-stabilizing system with no distinguished processor if the size of the ring is prime. Our basic protocol use Θ(n2) states in each processor, where n is the size of the ring. We also give a refined protocol which uses only Θ(n2/ln n) states.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ang80]
    D. Angluin. Local and global properties in networks of processors. Proc. 12th Symp. on Theory of Computing (Los Angeles, CA, April 1980), ACM, 1980, pp. 82–93.Google Scholar
  2. [BGW]
    G.M. Brown, M.G. Gouda, and C.-L. Wu. Token systems that self-stabilize. Manuscript.Google Scholar
  3. [Dij74]
    E.W. Dijkstra. Self-stabilizing systems in spite of distributed control., Communications of the ACM 17, 11 (1974) 643–644.MATHCrossRefGoogle Scholar
  4. [Dij82]
    E.W. Dijkstra. Self-stabilization in spite of distributed control (EWD391). Reprinted in Selected Writing on Computing: A Personal Perspective, Springer-Verlag, Berlin, 1982, 41–46.Google Scholar
  5. [Dij86]
    E.W. Dijkstra. A belated proof of self-stabilization. Distributed Computing 1, 1 (1986) 5–6.MATHMathSciNetCrossRefGoogle Scholar
  6. [Gro84]
    E. Grosswald. Topics from the Theory of Numbers. Birkhäuser Boston, 1984.Google Scholar
  7. [HK84]
    R.W. Haddad and D.E. Knuth. A programming and problem-solving seminar. Stanford University Technical Report STAN-CS-85-1055, June 1985.Google Scholar
  8. [Kru79]
    H.S.M. Kruijer. Self-stabilization (in spite of distributed control) in tree-structured systems. Information Processing Letters 8, 2 (1979) 91–95.MATHMathSciNetCrossRefGoogle Scholar
  9. [Lam84]
    L. Lamport. Solved problems, unsolved problems, and non-problems in concurrency. Invited address at the 2nd Symp. on Principles of Distributed Computing (Montreal, August 17–19, 1983), included in Proc. of the 3rd Symp. on Principles of Distributed Computing, ACM, 1984, pp. 1–11.Google Scholar
  10. [Seg86]
    C.-J. Seger. A note for the graduate course CS 760. University of Waterloo, October 2, 1986.Google Scholar
  11. [Seg87]
    C.-J. Seger. Private communication.Google Scholar
  12. [Tch81]
    M. Tchuente. Sur l'auto-stabilization dans un réseau d'ordinateurs. RAIRO Inf. Theor. 15, 1981, 47–66.MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • James E. Burns
    • 1
  • Jan Pachl
    • 2
  1. 1.Georgia Institute of TechnologyUSA
  2. 2.University of WaterlooUSA

Personalised recommendations