The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Open accessAbstract
Fault tolerance in distributed computing is a wide area with a significant body of literature that is vastly diverse in methodology and terminology. This paper aims at structuring the area and thus guiding readers into this interesting field. We use a formal approach to define important terms like fault, fault tolerance , and redundancy . This leads to four distinct forms of fault tolerance and to two main phases in achieving them: detection and correction . We show that this can help to reveal inherently fundamental structures that contribute to understanding and unifying methods and terminology. By doing this, we survey many existing methodologies and discuss their relations. The underlying system model is the close-to-reality asynchronous message-passing model of distributed computing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Time, clocks, and the ordering of events in a distributed system
Lamport, L. (1978) · Communications of the ACM · doi:10.1145/359545.359563 · Cited by 8,488
The Byzantine generals problem
Lamport, L., Shostak, R., & Pease, M. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357172.357176 · Cited by 6,023
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Unreliable failure detectors for reliable distributed systems
Chandra, T. D., & Toueg, S. (1996) · Journal of the ACM · doi:10.1145/226643.226647 · Cited by 2,513
Implementing fault-tolerant services using the state machine approach: a tutorial
Schneider, F. B. (1990) · ACM Computing Surveys · doi:10.1145/98163.98167 · Cited by 2,387
A case for redundant arrays of inexpensive disks (RAID)
Patterson, D. A., Gibson, G., & Katz, R. H. (1988) · ACM SIGMOD Record · doi:10.1145/971701.50214 · Cited by 2,281
Self-stabilizing systems in spite of distributed control
Dijkstra, E. W. (1974) · Communications of the ACM · doi:10.1145/361179.361202 · Cited by 2,097
Guarded commands, nondeterminacy and formal derivation of programs
Dijkstra, E. W. (1975) · Communications of the ACM · doi:10.1145/360933.360975 · Cited by 1,941
Consensus in the presence of partial synchrony
Dwork, C., Lynch, N., & Stockmeyer, L. (1988) · Journal of the ACM · doi:10.1145/42282.42283 · Cited by 1,909
Proving the Correctness of Multiprocess Programs
Lamport, L. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229904 · Cited by 1,138
Alpern, B., & Schneider, F. B. (1985) · Information Processing Letters · doi:10.1016/0020-0190(85)90056-0 · Cited by 1,038
Knowledge and common knowledge in a distributed environment
Halpern, J. Y., & Moses, Y. (1990) · Journal of the ACM · doi:10.1145/79147.79161 · Cited by 955
Fault injection techniques and tools
Hsueh, M.-C., Tsai, T. K., & Iyer, R. K. (1997) · Computer · doi:10.1109/2.585157 · Cited by 884
Introduction to Distributed Algorithms
Tel, G. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9781139168724 · Cited by 859
Fail-stop processors: an approach to designing fault-tolerant computing systems
Schlichting, R. D., & Schneider, F. B. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357369.357371 · Cited by 769
The process group approach to reliable distributed computing
Birman, K. P. (1993) · Communications of the ACM · doi:10.1145/163298.163303 · Cited by 729
Understanding fault-tolerant distributed systems
Cristian, F. (1991) · Communications of the ACM · doi:10.1145/102792.102801 · Cited by 694
On the minimal synchronism needed for distributed consensus
Dolev, D., Dwork, C., & Stockmeyer, L. (1987) · Journal of the ACM · doi:10.1145/7531.7533 · Cited by 620
Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics
Leeuwen, J. V. (1994) · Cited by 620
Fault Tolerance in Distributed Systems
Jalote, P. (1994) · Medical Entomology and Zoology · Cited by 533
Reaching approximate agreement in the presence of faults
Dolev, D., Lynch, N. A., Pinter, S. S., Stark, E. W., & Weihl, W. E. (1986) · Journal of the ACM · doi:10.1145/5925.5931 · Cited by 525
Asynchronous consensus and broadcast protocols
Bracha, G., & Toueg, S. (1985) · Journal of the ACM · doi:10.1145/4221.214134 · Cited by 513
DEPENDABLE COMPUTING AND FAULT TOLERANCE : CONCEPTS AND TERMINOLOGY
Laprie, J.-C. (2005) · Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'. · doi:10.1109/ftcsh.1995.532603 · Cited by 460
Detecting causal relationships in distributed computations: In search of the holy grail
Schwarz, R., & Mattern, F. (1994) · Distributed Computing · doi:10.1007/bf02277859 · Cited by 430
The consensus problem in fault-tolerant computing
Barborak, M., Dahbura, A., & Malek, M. (1993) · ACM Computing Surveys · doi:10.1145/152610.152612 · Cited by 400
Fault-tolerant computing: fundamental concepts
Nelson, V. P. (1990) · Computer · doi:10.1109/2.56849 · Cited by 359
Lynch, N. (1996) · Cited by 354
Closure and convergence: a foundation of fault-tolerant computing
Arora, A., & Gouda, M. G. (1993) · IEEE Transactions on Software Engineering · doi:10.1109/32.256850 · Cited by 258
Easy impossibility proofs for distributed consensus problems
Fischer, M. J., Lynch, N. A., & Merritt, M. (1986) · Distributed Computing · doi:10.1007/bf01843568 · Cited by 257
Chandy, K. M., & Misra, J. (1986) · Distributed Computing · doi:10.1007/bf01843569 · Cited by 218
The many faces of consensus in distributed systems
Turek, J., & Shasha, D. (1992) · Computer · doi:10.1109/2.153253 · Cited by 176
Distributed Computing: Models and Methods
Lamport, L., & Lynch, N. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88074-1.50023-8 · Cited by 146
A Rigorous Approach to Fault-Tolerant Programming
Cristian, F. (1985) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1985.231534 · Cited by 86
What good are models and what models are good
Schneider, F. B. (1993) · ACM Press/Addison-Wesley Publishing Co. eBooks · Cited by 73
Designing masking fault-tolerance via nonmasking fault-tolerance
Arora, A., & Kulkarni, S. S. (1998) · IEEE Transactions on Software Engineering · doi:10.1109/32.689401 · Cited by 56
The SunSCALR framework for Internet servers
Singhai, A., Lim, S.-B., & Radia, S. (2002) · doi:10.1109/ftcs.1998.689460 · Cited by 28
Faster possibility detection by combining two approaches
Stoller, S. D., & Schneider, F. B. (1995) · Lecture notes in computer science · doi:10.1007/bfb0022156 · Cited by 28
Guest Editorial Reflections on Requirements
(1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.229898 · Cited by 22
Cited by
Handling obstacles in goal-oriented requirements engineering
van Lamsweerde, A., & Letier, E. (2000) · IEEE Transactions on Software Engineering · doi:10.1109/32.879820 · Cited by 648
Help Seeking and Help Design in Interactive Learning Environments
Aleven, V., Stahl, E., Schworm, S., Fischer, F., & Wallace, R. (2003) · Review of Educational Research · doi:10.3102/00346543073003277 · Cited by 609
Metadata
- Authors
- Gärtner, F. C.
- Venue
- ACM Computing Surveys
- Published
- 1999-03
- Volume
- 31
- Issue
- 1
- Pages
- 1-26
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2169624732
- Cited by
- 346
- References
- 39
- FWCI
- 16.87
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.