A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is
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. ... In [BD95] Beauquier and Debas introduced a similar three state algorithm, to which we refer in this paper as algorithm BD, and they show an upper bound of 5 3 4 n 2 + O(n) for its stabilization time. ...doi:10.1007/978-3-540-69355-0_19 fatcat:jp3osf7ulvex7d5f3vxyia2bsa
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented three such algorithms for the problem of mutual exclusion on a ring of n processors. ... We also present a new-three state self-stabilizing algorithm for mutual exclusion and show a tight bound of 5 6 n 2 + O(n) for the worst case complexity of this algorithm. ... A new Self-stabilizing Algorithm for Mutual Exclusion In this section we present a new algorithm A for self-stabilization. ...doi:10.1007/s00446-010-0104-6 fatcat:f4mhdpmtcvggfh2qdwndodcgoe