TY - GEN
T1 - Dijkstra’s self-stabilizing algorithm in unsupportive environments
AU - Dolev, Shlomi
AU - Herman, Ted
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2001.
PY - 2001/1/1
Y1 - 2001/1/1
N2 - The first self-stabilizing algorithm published by Dijkstra in 1973 assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered this algorithm without the assumption of a central daemon, and under different forms of communication, such as the model of link registers. In all of these investigations, one common feature is the atomicity of communication, whether by shared variables or read/write registers. This paper weakens the atomicity assumptions for the communication model, proposing versions of Dijkstra's algorithm that tolerate various weaker forms of atomicity, including cases of regular and safe registers. The paper also presents an implementation of Dijkstra's algorithm based on registers that have probabilistically correct behavior, which requires a notion of weak stabilization, where Markov chains are used to evaluate the probability to be in a safe configuration.
AB - The first self-stabilizing algorithm published by Dijkstra in 1973 assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered this algorithm without the assumption of a central daemon, and under different forms of communication, such as the model of link registers. In all of these investigations, one common feature is the atomicity of communication, whether by shared variables or read/write registers. This paper weakens the atomicity assumptions for the communication model, proposing versions of Dijkstra's algorithm that tolerate various weaker forms of atomicity, including cases of regular and safe registers. The paper also presents an implementation of Dijkstra's algorithm based on registers that have probabilistically correct behavior, which requires a notion of weak stabilization, where Markov chains are used to evaluate the probability to be in a safe configuration.
UR - http://www.scopus.com/inward/record.url?scp=84958962518&partnerID=8YFLogxK
U2 - 10.1007/3-540-45438-1_5
DO - 10.1007/3-540-45438-1_5
M3 - Conference contribution
SN - 3540426531
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 67
EP - 81
BT - Self-Stabilizing Systems - 5th InternationalWorkshop, WSS 2001 Lisbon, Portugal, October 1-2, 2001 Proceedings
A2 - Herman, Ted
A2 - Datta, Ajoy K.
PB - Springer Verlag
T2 - 5th International Workshop on Self-Stabilizing Systems, WSS 2001
Y2 - 1 October 2001 through 2 October 2001
ER -