The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Unreliable failure detectors for reliable distributed systems
Open accessAbstract
We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties—completeness and accuracy. We show that Consensus can be solved even with unreliable failure detectors that make an infinite number of mistakes, and determine which ones can be used to solve Consensus despite any number of crashes, and which ones require a majority of correct processes. We prove that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast. A companion paper shows that one of the failure detectors introduced here is the weakest failure detector for solving Consensus [Chandra et al. 1992].
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
Reaching Agreement in the Presence of Faults
Pease, M., Shostak, R., & Lamport, L. (1980) · Journal of the ACM · doi:10.1145/322186.322188 · Cited by 2,359
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
Reliable communication in the presence of failures
Birman, K. P., & Joseph, T. A. (1987) · ACM Transactions on Computer Systems · doi:10.1145/7351.7478 · Cited by 997
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
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
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
Ben-Or, M. (1983) · Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83 · doi:10.1145/800221.806707 · Cited by 590
SIFT: Design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Green, M. W., Levitt, K. N., Melliar-Smith, P. M., Shostak, R. E., & Weinstock, C. B. (1978) · Proceedings of the IEEE · doi:10.1109/proc.1978.11114 · Cited by 568
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
Self-citationFault-tolerant broadcasts and related problems
Hadzilacos, V., & Toueg, S. (1993) · ACM Press/Addison-Wesley Publishing Co. eBooks · Cited by 478
Self-citationThe consensus problem in unreliable distributed systems (a brief survey)
Fischer, M. J. (1983) · Lecture Notes in Computer Science · doi:10.1007/3-540-12689-9_99 · Cited by 367
Transis: a communication subsystem for high availability
Amir, Y., Dolev, D., Kramer, S., & Malki, D. (2003) · IEEE International Symposium on Fault-Tolerant Computing · doi:10.1109/ftcs.1992.243613 · Cited by 360
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT
Cristian, F., Aghili, H., Strong, R., & Volev, D. (2005) · Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'. · doi:10.1109/ftcsh.1995.532668 · Cited by 353
Preserving and using context information in interprocess communication
Peterson, L. L., Buchholz, N. C., & Schlichting, R. D. (1989) · ACM Transactions on Computer Systems · doi:10.1145/65000.65001 · Cited by 325
The implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
Using process groups to implement failure detection in asynchronous environments
Ricciardi, A. M., & Birman, K. (1991) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/112600.112628 · Cited by 170
Towards optimal distributed consensus
Berman, P., Garay, J. A., & Perry, K. J. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63511 · Cited by 124
Proceedings of the 28th ACM symposium on Principles of distributed computing
(2009) · doi:10.1145/1582716 · Cited by 118
Automatically increasing the fault-tolerance of distributed algorithms
Neiger, G., & Toueg, S. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90019-b · Cited by 112
Self-citationCheating husbands and other stories: A case study of knowledge, action, and communication
Moses, Y., Dolev, D., & Halpern, J. Y. (1986) · Distributed Computing · doi:10.1007/bf01661170 · Cited by 78
Biran, O., Moran, S., & Zaks, S. (1988) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/62546.62590 · Cited by 62
A new solution for the Byzantine generals problem
Reischuk, R. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80042-5 · Cited by 60
Time and message efficient reliable broadcasts
Chandra, T. D., & Toueg, S. (1991) · Lecture notes in computer science · doi:10.1007/3-540-54099-7_20 · Cited by 47
Self-citationReliable scheduling in a TMR database system
Pittelli, F. M., & García-Molina, H. (1989) · ACM Transactions on Computer Systems · doi:10.1145/58564.59294 · Cited by 37
Early-delivery atomic broadcast
Gopal, A. S., Strong, R., Toueg, S., & Cristian, F. (1990) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/93385.93430 · Cited by 26
Self-citation
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
A Survey of Distributed Consensus Protocols for Blockchain Networks
Xiao, Y., Zhang, N., Lou, W., & Hou, Y. T. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2969706 · Cited by 841
Saito, Y., & Shapiro, M. (2005) · ACM Computing Surveys · doi:10.1145/1057977.1057980 · Cited by 739
Group communication specifications: a comprehensive study
Chockler, G. V., Keidar, I., & Vitenberg, R. (2001) · ACM Computing Surveys · doi:10.1145/503112.503113 · Cited by 630
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
Metadata
- Authors
- Chandra, T. D., & Toueg, S.
- Venue
- Journal of the ACM
- Published
- 1996-03
- Volume
- 43
- Issue
- 2
- Pages
- 225-267
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2133943294
- Cited by
- 2,513
- References
- 28
- FWCI
- 69.56
- 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.