Abstract
Self-stabilizing leader election protocols elect a single processor, leader, even when initiated from an arbitrary (e.g. faulty) configuration. Deterministic self-stabilizing leader election is impossible even on rings, if the number of processors is composite, no matter what computational resources are available to the processors. Moreover, it remains impossible even if the number of processors is prime, but each processor has less than log(n −1) bits of memory and the ring is unidirectional (i.e. each processor sees only itself and its clockwise neighbor). We show, however, that the deterministic self-stabilizing leader election is possible even if the processors are of constant size if the rings are bi-directional. More precisely, we present a deterministic uniform and constant space leader election protocol for prime sized rings under a central demon.
Partially supported by Israeli Council for Higher Education.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch and R. Ostrovsky. Memory-efficient and self-stabilizing network reset. PODC'94, pp. 254–263
J.E. Burns and J. Pachl. Uniform Self-Stabilizing Rings. ACM Transactions on Programming Languages and Systems. (April 1989), pp. 330–344.
E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Commum. ACM 17, 11 (Nov. 1974), PP. 643–644.
T. Herman. Probabilistic Self-Stabilization. IPL 35 (1990), pp. 63–67.
S. T. Huang. Leader Election in Uniform Rings. ACM Transactions on Programming Languages and Systems. (July 1993), pp. 563–573.
A. Israeli and M. Jalfon. Token management schemes and random walks yield self stabilizing mutual exclusion. PODC'90, pp. 119–130.
G. Itkis. Self-stabilizing distributed computation with constant space per edge. Presented at colloquia at MIT, IBM, Bellcore, CMU, ICSI Berkeley, Stanford, SRI, UC Davis. 1992. Includes joint results with B. Awerbuch and R. Ostrovsky, and with L. Levin.
G. Itkis and L. Levin. Self-stabilization with constant space. Manuscript, Nov. 1992 (submitted to STOC'93; Also reported by L. Levin in ICALP Tutorial Lecture, July 1994. Later version: Fast and lean self-stabilizing asynchronous protocols. TR#829, Technion, Israel, July 1994.
G. Itkis and L. Levin. Fast and Lean Self-Stabilizing Asynchronous Protocols, STOC'94, pp. 226–239.
C. Lin. Resource efficient self-stabilizing systems, Ph.D. Dissertation, University of Chicago, 1995
C. Lin and J. Simon. Observing Self-Stabilization, PODC'92, pp. 113–123.
A. Mayer, Y. Ofek, R. Ostrovsky and M. Yung. Self-Stabilizing Symmetry Breaking in Constant-Space, STOC'92, pp. 667–678.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Itkis, G., Lin, C., Simon, J. (1995). Deterministic, constant space, self-stabilizing leader election on uniform rings. In: Hélary, JM., Raynal, M. (eds) Distributed Algorithms. WDAG 1995. Lecture Notes in Computer Science, vol 972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022154
Download citation
DOI: https://doi.org/10.1007/BFb0022154
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60274-3
Online ISBN: 978-3-540-44783-2
eBook Packages: Springer Book Archive