A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite, no deterministic solutions exist, because it is impossible to break symmetry.
CITATION STYLE
Fich, F. E., & Johnen, C. (2001). A space optimal, deterministic, self-stabilizing, leader election algorithm for unidirectional rings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2180, pp. 224–239). Springer Verlag. https://doi.org/10.1007/3-540-45414-4_16
Mendeley helps you to discover research relevant for your work.