On the Performance of Beauquier and Debas' Self-stabilizing Algorithm for Mutual Exclusion [chapter]

Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
Lecture Notes in Computer Science  
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented an algorithm with three states for the problem of mutual exclusion on a ring of processors. In [BD95] a similar three state algorithm with an upper bound of 5 3 4 n 2 + O(n) and a lower bound of 1 8 n 2 − O(n) were presented for its stabilization time. For this later algorithm we prove an upper bound of 1 1 2 n 2 + O(n), and show a lower bound of n 2 − O(n).
doi:10.1007/978-3-540-69355-0_19 fatcat:jp3osf7ulvex7d5f3vxyia2bsa