Probabilistic self-stabilization
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilizing Local Mutual Exclusion on Networks in which Process Identifiers are not Distinct
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
2-State Alternator for Uniform Rings with Arbitrary Size
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Alternators on uniform rings of odd size
Distributed Computing
Randomized three-state alternator for uniform rings
Journal of Parallel and Distributed Computing
Alternators in read/write atomicity
Information Processing Letters
| Hi-index | 0.00 |
We introduce an alternator with uniform processes that executes in a process graph of arbitrary topology. In general, alternators are free from deadlock, protect against simultaneous execution of the critical sections of dependent processes, and after a finite number of executions provide a high degree of concurrency and some degree of fairness (deterministically or stochastically). Because this alternator has uniform processes, strong fairness and concurrency are properties obtained after a finite number of steps with an arbitrary probability, due to the possibility of symmetry in states. The size of the state space and the periodicity of critical section execution are dependent upon the initial state. The worst case size of the state space utilized and period between critical sections executions depend upon the diameter of the graph of processes. An important value of alternators is their capacity for transforming systems correct under serial (interleaving) semantics to systems correct under concurrent or maximal (power set) semantics. This property is based upon a graph of processes representing the alternator in which the vertices are processes and the edges are dependencies between processes.