Self-stabilizing systems in spite of distributed control
Communications of the ACM
Information Processing Letters
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
Dining Philosophers that Tolerate Malicious Crashes
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Self-Stabilizing Neighborhood Synchronizer in Tree Networks
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Alternating parallelism and the stabilization of distributed systems
Alternating parallelism and the stabilization of distributed systems
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Alternators on uniform rings of odd size
Distributed Computing
A uniform process alternator for arbitrary topologies
Journal of High Speed Networks
| Hi-index | 0.00 |
In this paper, we propose a three-state alternator algorithm for uniform ring with n processors, where n 1. The proposed algorithm is a randomized algorithm and operates correctly for synchronous mode. An alternator is a self-stabilization system that satisfies the following properties. (1) The safety property: if a processor executes the critical step, no neighbor executes the critical step at the same computing phase. (2) The liveness property: along any infinite computing phases, every processor executes the critical step infinitely often.An alternator is 1-fair if between any two consecutive critical steps of a processor, all other processors execute the critical step exactly once. The proposed alternator is 1-fair. It allows each processor to execute the critical step every three phases.The proposed algorithm has the snap property in the sense that the system satisfies the safety property of the alternator even if some transient fault occurs. The worst-case stabilization time of the algorithm is an expected number of two phases plus a deterministic number of at most 2(n - 2) phases.