Dijkstra’s self-stabilizing algorithm in unsupportive environments

Shlomi Dolev, Ted Herman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationSelf-Stabilizing Systems - 5th InternationalWorkshop, WSS 2001 Lisbon, Portugal, October 1-2, 2001 Proceedings
EditorsTed Herman, Ajoy K. Datta
PublisherSpringer Verlag
Pages67-81
Number of pages15
ISBN (Print)3540426531
DOIs
StatePublished - 1 Jan 2001
Event5th International Workshop on Self-Stabilizing Systems, WSS 2001 - Lisbon, Portugal
Duration: 1 Oct 20012 Oct 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2194
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Workshop on Self-Stabilizing Systems, WSS 2001
Country/TerritoryPortugal
CityLisbon
Period1/10/012/10/01

Fingerprint

Dive into the research topics of 'Dijkstra’s self-stabilizing algorithm in unsupportive environments'. Together they form a unique fingerprint.

Cite this