Memory requirements for silent stabilization (extended abstract)

Shlomi Dolev, Mohamed G. Gouda, Marco Schneider

Research output: Contribution to conferencePaperpeer-review

34 Scopus citations

Abstract

A self-stabilizing algorithm is silent if it converges to a global state after which the values stored in the communication registers are fixed. The silence property of self-stabilizing algorithms is a desirable property in terms of simplicity and communication overhead. In this work we show that no constant memory silent self-stabilizing algorithms exist for identification of the centers of a graph, leader election, and spanning tree construction. Lower bounds of Ω(log n) bits per communication register are obtained for each of the above tasks. The existence of a silent legitimate global state that uses less than log n bits per register is assumed. This legitimate global state is used to construct a silent global state that is illegitimate.

Original languageEnglish
Pages27-34
Number of pages8
StatePublished - 1 Jan 1996
EventProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA
Duration: 23 May 199626 May 1996

Conference

ConferenceProceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing
CityPhiladelphia, PA, USA
Period23/05/9626/05/96

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Memory requirements for silent stabilization (extended abstract)'. Together they form a unique fingerprint.

Cite this