Affiliation:
1. Georgia Institute of Technology, Atlanta
2. Zurich Research Lab, Rüschlikon, Switzerland
Abstract
A
self-stabilizing system
has the property that, no matter how it is perturbed, it eventually returns to a legitimate configuration. Dijkstra originally introduced the self-stabilization problem and gave several solutions for a ring of processors in his 1974
Communications of the ACM
paper. His solutions use a distinguished processor in the ring, which effectively acts as a controlling element to drive the system toward stability. Dijkstra has observed that a distinguished processor is essential if the number of processors in the ring is composite. We show, by presenting a protocol and proving its correctness, that there is a self-stabilizing system with no distinguished processor if the size of the ring is prime. The basic protocol uses Θ (
n
2
) states in each processor when
n
is the size of the ring. We modify the basic protocol to obtain one that uses Θ (
n
2
/ln
n
) states.
Publisher
Association for Computing Machinery (ACM)
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Origin of Self-Stabilization;Edsger Wybe Dijkstra;2022-07-12
2. REBOUND;Proceedings of the Sixteenth European Conference on Computer Systems;2021-04-21
3. Game Theoretic Analysis of Self-Stabilizing Systems on Arrays;Journal of Computer and Systems Sciences International;2021-03
4. Reactive Pls for Distributed Decision;SSRN Electronic Journal;2021
5. Leader-based de-anonymization of an anonymous read/write memory;Theoretical Computer Science;2020-10