Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic self-stabilization
Information Processing Letters
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilizing ring orientation
Proceedings of the 4th international workshop on Distributed algorithms
ACM Computing Surveys (CSUR)
Leader election in uniform rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Uniform self-stabilizing ring orientation
Information and Computation
Probabilistic self-stabilizing mutual exclusion in uniform rings
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Symbolic Model Checking for Self-Stabilizing Algorithms
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
A distributed system is said to be self-stabilizing if it will eventually reach a legitimate system state regardless of its initial state. Because of this property, a self-stabilizing system is extremely robust against failures; it tolerates any finite number of transient failures. The ring orientation problem for a ring is the problem of all the processors agreeing on a common ring direction. This paper focuses on the problem of designing a deterministic self-stabilizing ring orientation system with a small number of processor states under the distributed daemon. Because of the impossibility of symmetry breaking, under the distributed daemon, no such systems exist when the number n of processors is even. Provided that n is odd, the best known upper bound on the number of states is 256 in the link-register model, and eight in the state-reading model. We improve the bound down to 63 = 216 in the link-register model.