The search functionality is under construction.
The search functionality is under construction.

Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom

Toshimitsu MASUZAWA, Michiko INOUE

  • Full Text Views

    0

  • Cite this

Summary :

Distributed computation has attracted considerable attention and large-scale distributed systems have been designed and developed. A distributed system inherently has possibility of fault tolerance because of its redundancy. Thus, a great deal of investigation has been made to design fault-tolerant distributed algorithms. This paper introduces two promising paradigms, self-stabilization and wait-freedom, for designing fault-tolerant distributed algorithms and discusses some subjects important from the point of view of algorithm engineering.

Publication
IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.550-560
Publication Date
2000/03/25
Publicized
Online ISSN
DOI
Type of Manuscript
INVITED SURVEY PAPER
Category
Parallel and Distributed Algorithms

Authors

Keyword