Self-stabilizing distributed algorithm for local mutual inclusion
A self-stabilizing distributed algorithm for the local mutual inclusion problem is presented. The local mutual inclusion is a problem such that for each process P, at least one of P and its neighbors is in critical section. Convergence time of the proposed algorithm is 1 round under weakly fair distributed daemon.
self-stabilization distributed algorithm mutual inclusion mutual exclusion process synchronization