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 language | English |
---|---|
Pages | 27-34 |
Number of pages | 8 |
State | Published - 1 Jan 1996 |
Event | Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing - Philadelphia, PA, USA Duration: 23 May 1996 → 26 May 1996 |
Conference
Conference | Proceedings of the 1996 15th Annual ACM Symposium on Principles of Distributed Computing |
---|---|
City | Philadelphia, PA, USA |
Period | 23/05/96 → 26/05/96 |
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Networks and Communications