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 application/pdf
.
On the Performance of Dijkstra's Third Self-stabilizing Algorithm for Mutual Exclusion
[chapter]
Lecture Notes in Computer Science
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 processors. The third algorithm is the most interesting of these three, but is rather non intuitive. In [Dij86] a proof of its correctness was presented, but the question of determining its worst case complexity -that is, providing an upper bound on the number of moves of this algorithm until it stabilizes -remained open. In this paper we
doi:10.1007/978-3-540-76627-8_11
dblp:conf/sss/ChernoySZ07
fatcat:wgsa6e53ojfh3lrvfg2k62sdia