Fault-Tolerance of Distributed Algorithms : Self-Stabilization and Wait-Freedom(Special Issue on Algorithm Engineering : Surveys)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2000-03-25
著者
-
MASUZAWA Toshimitsu
the Graduate School of Information Science and Technology, Osaka University
-
INOUE Michiko
the Graduate School of Information Science, Nara Institute of Science and Technology(NAIST)
-
Masuzawa Toshimitsu
The Graduate School Of Information Science And Technology Osaka University
-
Inoue Michiko
The Graduate School Of Information Science Nara Institute Of Science And Technology(naist)
関連論文
- Fault-Tolerant and Self-Stabilizing Protocols Using an Unreliable Failure Detector
- Timed Uniform Atomic Broadcast in Presence of Crash and Timing Faults(Foundations of Computer Science)
- Wait-Free Linearizable Distributed Shared Memory
- Parallel Algorithms for the All Nearest Neighbors of Binary Image on the BSP Model
- High-Level Synthesis for Weakly Testable Data Paths(Special Issue on Test and Diagnosis of VLSI)
- A Simple Parallel Algorithm for the Medial Axis Transform (Special Issue on Architectures Algorithms and Networks for Massively parallel Computing)
- A Parallel Method for the Prefix Convex Hulls Problem
- Distributed Leader Election on Chordal Ring Networks
- Scheduling for Independent-Task Applications on Heterogeneous Parallel Computing Environments under the Unidirectional One-Port Model(Parallel and Distributed Computing,Foundations of Computer Science)
- Scheduling for Gather Operation in Heterogeneous Parallel Computing Environments
- Fault-Tolerance of Distributed Algorithms : Self-Stabilization and Wait-Freedom(Special Issue on Algorithm Engineering : Surveys)
- A Non-scan DFT Method at Register-Transfer Level to Achieve 100% Fault Efficiency (特集:システムLSIの設計技術と設計自動化)
- Parallel Selection Algorithms for CGM and BSP Models with Application to Sorting (特集 並列処理) -- (並列・分散アルゴリズム)
- Efficient Linearizable Implementation of Shared FIFO Queues and General Objects on a Distributed System(Special Section on Discrete Mathematics and Its Applications)
- Test Pattern Ordering and Selection for High Quality Test Set under Constraints