Back to Search
Start Over
Tolerating Transient and Intermittent Failures
- Source :
-
Journal of Parallel & Distributed Computing . May2002, Vol. 62 Issue 5, p961. 21p. - Publication Year :
- 2002
-
Abstract
- Fault tolerance is a crucial property for recent distributed systems. We propose an algorithm that solves the census problem (list all processor identifiers and their relative distance) on an arbitrary strongly connected network.This algorithm tolerates transient faults that corrupt the processors and communication links memory (it is self-stabilizing) as well as intermittent faults (fair loss, reorder, finite duplication of messages) on communication media. A formal proof establishes its correctness for the considered problem. Our algorithm leads to the construction of algorithms for any silent problems that are self-stabilizing while supporting the same communication hazards. [Copyright &y& Elsevier]
- Subjects :
- *FAULT-tolerant computing
*DISTRIBUTED computing
Subjects
Details
- Language :
- English
- ISSN :
- 07437315
- Volume :
- 62
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Journal of Parallel & Distributed Computing
- Publication Type :
- Academic Journal
- Accession number :
- 8502016
- Full Text :
- https://doi.org/10.1006/jpdc.2001.1827