A belated proof of self-stabilization
Distributed Computing
An exercise in proving self-stabilization with a variant function
Information Processing Letters
Self-stabilization
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
On the performance of Dijkstra's third self-stabilizing algorithm for mutual exclusion
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fast Distributed Approximations in Planar Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
| Hi-index | 0.00 |
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\frac{3}{4}n^2+O(n)$ and a lower bound of $\frac{1}{8}n^2-O(n)$ were presented for its stabilization time. For this later algorithm we prove an upper bound of $1\frac{1}{2}n^2 + O(n)$, and show a lower bound of n2茂戮驴 O(n).