Parallel and Distributed Processing Symposium, International (2000)
May 1, 2000 to May 5, 2000
Ajoy K. Datta , University of Nevada at Las Vegas
Maria Gradinariu , Universit? de Paris Sud
Sébastien Tixeuil , Universit? de Paris Sud
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explicit exception handler of backward recovery. Mutual exclusion is fundamental in the area of distributed computing, by serializing the accesses to a common shared resource. All existing probabilistic self-stabilizing mutual exclusion algorithms designed to work under an unfair distributed scheduler suffer from the following common drawback: Once stabilized, there exists no upper bound of time between two executions of the critical section at a given node. We present the first probabilistic self-stabilizing algorithm that guarantees such a bound (O(n 3 ),where n is the network size) while working using an unfair distributed scheduler. As the scheduling adversary gets weaker, the bound gets better. Our algorithm works in an anonymous unidirectional ring of any size and has a O(n 3 ) expected stabilization time. Due to space restriction, proofs are omitted from this extended abstract and can be found in .
M. Gradinariu, S. Tixeuil and A. K. Datta, "Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler," Parallel and Distributed Processing Symposium, International(IPDPS), Cancun, Mexico, 2000, pp. 465.