preprint · ArXiv.org · 2001
Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments
Cited by 0Open access
Abstract
The first self-stabilizing algorithm [Dij73] 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 [Dij73] that tolerate various weaker forms of atomicity. First, a solution for the case of regular registers is presented. Then the case of safe registers is considered, with both negative and positive results presented. The paper also presents an implementation of [Dij73] based on registers that have probabilistically correct behavior, which requires a notion of weak stabilization.
Cite this paper
Dolev, S., & Herman, T. (2001). Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments. ArXiv.org. https://doi.org/10.48550/arxiv.cs/0105013
Dolev, Shlomi, and Ted Herman. “Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments.” ArXiv.org, 2001, https://doi.org/10.48550/arxiv.cs/0105013.
Dolev, Shlomi, and Ted Herman. 2001. “Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments.” ArXiv.org. https://doi.org/10.48550/arxiv.cs/0105013.
Dolev, S. and Herman, T. (2001) ‘Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments’, ArXiv.org. Available at: https://doi.org/10.48550/arxiv.cs/0105013.
@misc{dolev2001dijkstra,
title = {{Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments}},
author = {Dolev, Shlomi and Herman, Ted},
journal = {ArXiv.org},
year = {2001},
doi = {10.48550/arxiv.cs/0105013}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
The Design and Implementation of Distributed Semaphore
Jinghua Cao, YanZhong Ran, ZhiJun Xu · International Conference on E-Product E-Service and E-Entertainment · 2010
Cited by 2
Atomicity: Formal Definition and Properties
Michel Raynal · Springer eBooks · 2012
Cited by 0
Correctness of Self-stabilizing Algorithms under the Dolev Model When Adapted to Composite Atomicity Models
Chih-Yuan Chen, Cheng-Pin Wang, Tetz C. Huang et al. · Smart innovation, systems and technologies · 2012
Cited by 5
Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models
Chih-Yuan Chen, Cheng-Pin Wang, Tetz C. Huang et al. · International Journal of Artificial Life Research · 2012
Cited by 6
Quasi-self-stabilization of a distributed system assuming read/write atomicity
Ji-Cherng Lin, Tetz C. Huang, Cheng‐Zen Yang et al. · Computers & Mathematics with Applications · 2008
Cited by 4Open access
Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
Ajoy K. Datta, Stéphane Devismes, Colette Johnen et al. · Theoretical Computer Science · 2023
Cited by 3Open access