### Self-stabilizationSelf-stabilization

Access Restriction
Subscribed

 Author Schneider, Marco Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1993 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Convergence ♦ Fault tolerance ♦ Self-stabilization ♦ Self-stabilizing systems ♦ Stabilization ♦ Transient errors ♦ Transient failures Abstract In 1973 Dijkstra introduced to computer science the notion of self-stabilization in the context of distributed systems. He defined a system as $\textit{self-stabilizing}$ when “regardless of its initial state, it is guaranteed to arrive at a legitimate state in a finite number of steps.” A system which is not self-stabilizing may stay in an illegitimate state forever. Dijkstra's notion of self-stabilization, which originally had a very narrow scope of application, is proving to encompass a formal and unified approach to fault tolerance under a model of transient failures for distributed systems. In this paper we define self-stabilization, examine its significance in the context of fault tolerance, define the important research themes that have arisen from it, and discuss the relevant results. In addition to the issues arising from Dijkstra's original presentation as well as several related issues, we discuss methodologies for designing self-stabilizing systems, the role of compilers with respect to self-stabilization, and some of the factors that prevent self-stabilization. ISSN 03600300 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1993-03-01 Publisher Place New York e-ISSN 15577341 Journal ACM Computing Surveys (CSUR) Volume Number 25 Issue Number 1 Page Count 23 Starting Page 45 Ending Page 67

#### Open content in new tab

Source: ACM Digital Library