When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Randomized three-state alternator for uniform rings
Journal of Parallel and Distributed Computing
Fault tolerance in wireless sensor networks through self-stabilisation
International Journal of Communication Networks and Distributed Systems
Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model
Discrete Applied Mathematics
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
A uniform process alternator for arbitrary topologies
Journal of High Speed Networks
| Hi-index | 0.00 |
A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers.Under the assumption that the process identifiers are chromatic, this paper proposes two self-stabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other, which works on any communication network, requires n +1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a self-stabilizing local mutual exclusion algorithm.We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.