Memory requirements for silent stabilization

Abstract. A stabilizing algorithm is silent if starting from an arbitrary state it converges to a global state after which the values stored in the communication registers are fixed. Many silent stabilizing algorithms have appeared in the literature. In this paper we show that there cannot exist constant memory silent stabilizing algorithms for finding the centers of a graph, electing a leader, and constructing a spanning tree. We demonstrate a lower bound of $\Omega(\log n)$ bits per communication register for each of the above tasks.

[1]  Shlomi Dolev,et al.  On the Computational Power of Self-Stabilizing Systems , 1997, Theor. Comput. Sci..

[2]  Mohamed G. Gouda,et al.  Stabilization of maximal metric trees , 1999, Proceedings 19th IEEE International Conference on Distributed Computing Systems.

[3]  Mohamed G. Gouda,et al.  The Stabilizing Token Ring in Three Bits , 1996, J. Parallel Distributed Comput..

[4]  Amos Israeli,et al.  Token management schemes and random walks yield self-stabilizing mutual exclusion , 1990, PODC '90.

[5]  Moti Yung,et al.  Non-Exploratory Self-Stabilization for Constant-Space Symmetry-Breaking , 1994, ESA.

[6]  Amos Israeli,et al.  Resource Bounds for Self-Stabilizing Message-Driven Protocols , 1997, SIAM J. Comput..

[7]  Shlomi Dolev.  Optimal Time Self Stabilization in Dynamic Systems (Preliminary Version) , 1993, WDAG.

[8]  Joffroy Beauquier,et al.  Space-Efficient, Distributed and Self-Stabilizing Depth-First Token Circulation , 1995 .

[9]  Leonid A. Levin,et al.  Fast and lean self-stabilizing asynchronous protocols , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[11]  Anish Arora,et al.  Distributed Reset , 1994, IEEE Trans. Computers.

[12]  Sandeep K. Shukla,et al.  Observations on self-stabilizing graph algorithms for anonymous networks , 1995 .

[13]  M. Gouda,et al.  Flow routing in computer networks , 1997 .

[14]  Mehmet Hakan Karaata,et al.  Self-Stabilizing Algorithms for Finding Centers and Medians of Trees , 1999, SIAM J. Comput..

[15]  Rafail Ostrovsky,et al.  Memory-efficient and self-stabilizing network RESET (extended abstract) , 1994, PODC '94.

[16]  Amos Israeli,et al.  Self-stabilization of dynamic systems assuming only read/write atomicity , 1990, PODC '90.

[17]  Janos Simon,et al.  Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings , 1995, WDAG.

[18]  Loo Keng Hua,et al.  Introduction to number theory , 1982 .

[19]  Edsger W. Dijkstra,et al.  Self-stabilizing systems in spite of distributed control , 1974, CACM.

[20]  Mohamed G. Gouda,et al.  Stabilization of maximum flow trees , 1994 .

[21]  Shlomi Dolev,et al.  Memory Requirements for Silent Stabilization (Extended Abstract). , 1996, PODC 1996.

[22]  Shlomi Dolev,et al.  SuperStabilizing protocols for dynamic distributed systems , 1995, PODC '95.

[23]  Marco Schneider,et al.  Self-stabilization , 1993, CSUR.