IEICE TRANSACTIONS on Information
Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom
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
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toshimitsu MASUZAWA, Michiko INOUE, "Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 550-560, March 2000, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_550/_p
Copy
@ARTICLE{e83-d_3_550,
author={Toshimitsu MASUZAWA, Michiko INOUE, },
journal={IEICE TRANSACTIONS on Information},
title={Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom},
year={2000},
volume={E83-D},
number={3},
pages={550-560},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Fault-Tolerance of Distributed Algorithms: Self-Stabilization and Wait-Freedom
T2 - IEICE TRANSACTIONS on Information
SP - 550
EP - 560
AU - Toshimitsu MASUZAWA
AU - Michiko INOUE
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - 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.
ER -
English
