An exercise in proving self-stabilization with a variant function
Information Processing Letters
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
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
ACM Computing Surveys (CSUR)
Collisions among random walks on a graph
SIAM Journal on Discrete Mathematics
Leader election in uniform rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic self-stabilizing mutual exclusion in uniform rings
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Randomized algorithms
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Readings in Distributed Computing Systems
Readings in Distributed Computing Systems
A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Randomized Finite-State Distributed Algorithms as Markov Chains
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Randomized dining philosophers without fairness assumption
Distributed Computing
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Information Processing Letters
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A space-efficient self-stabilizing algorithm for measuring the size of ring networks
Information Processing Letters
Introducing speculation in self-stabilization: an application to mutual exclusion
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is said to be self-stabilizing if it converges to a correct system state no matter which system state it starts with. A self-stabilizing system is considered to be an ideal fault tolerant system, since it tolerates any kind and any finite number of transient failures.In this paper, we investigate uniform randomized self-stabilizing mutual exclusion systems on unidirectional rings. As far as deterministic systems are concerned, it is well-known that there is no such system when the number n of processes (i.e., ring size) is composite, even if a fair central-daemon (c-daemon) is assumed. A fair daemon guarantees that every process will be selected for activation infinitely many times. As for randomized systems, regardless of the ring size, we can design a self-stabilizing system even for a distributed-daemon (d-daemon). However, every system proposed so far assumes a daemon to be fair, and effectively replies on this assumption.This paper tackles the problem of designing a self-stabilizing system, without assuming the fairness of a daemon. As a result, we present a randomized self-stabilizing mutual exclusion system for any size n (including composite size) of a unidirectional ring. The number of process states of the system is 2(n驴 1).