Affiliation:
1. Univ. of Texas, Austin
Abstract
In 1973 Dijkstra introduced to computer science the notion of self-stabilization in the context of distributed systems. He defined a system as
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.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference51 articles.
1. AmORA A. AND GOUDA M.G. 1992. Closure and convergence: A foundation for fault-tolerant computing. In Proceedzngs of the 22rid Internatzonal Conference on Fault-Tolerant Computing Systems. AmORA A. AND GOUDA M.G. 1992. Closure and convergence: A foundation for fault-tolerant computing. In Proceedzngs of the 22rid Internatzonal Conference on Fault-Tolerant Computing Systems.
Cited by
180 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献