Advertisement

Acta Informatica

, Volume 36, Issue 6, pp 447–462 | Cite as

Memory requirements for silent stabilization

  • Shlomi Dolev
  • Mohamed G. Gouda
  • Marco Schneider
Original articles

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.

Keywords

Span Tree Memory Requirement Global State Arbitrary State Communication Register 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Shlomi Dolev
    • 1
  • Mohamed G. Gouda
    • 2
  • Marco Schneider
    • 2
  1. 1.Department of Mathematics and Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel (e-mail: dolev@cs.bgu.ac.il) IL
  2. 2.Department of Computer Science, The University of Texas at Austin, Austin, TX 78712-1188, USA (e-mail: {gouda,marco}@cs.utexas.edu) US

Personalised recommendations