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

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 53 4 n2 + O(n) and a lower bound of 1 8 n2 - O(n) were presented for its stabilization time. For this later algorithm we prove an upper bound of 11 2 n2 + O(n), and show a lower bound of n2 - O(n).

• Type: Conference
• Year: 2008
• Where: SIROCCO
• Authors: Viacheslav Chernoy, Mordechai Shalom, Shmuel Zaks
• Keywords: Algorithm, Information Technology, Self-stabilizing Algorithms, SIROCCO 2008, Upper Bound