The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
On the minimal synchronism needed for distributed consensus
Open accessAbstract
Reaching agreement is a primitive of distributed computing. Whereas this poses no problem in an ideal, failure-free environment, it imposes certain constraints on the capabilities of an actual system: A system is viable only if it permits the existence of consensus protocols tolerant to some number of failures. Fischer et al. have shown that in a completely asynchronous model, even one failure cannot be tolerated. In this paper their work is extended: Several critical system parameters, including various synchrony conditions, are identified and how varying these affects the number of faults that can be tolerated is examined. The proofs expose general heuristic principles that explain why consensus is possible in certain models but not possible in others.
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
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
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
Self-citationProceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
Self-citationAnother 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
Rabin, M. O. (1983) · 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) · doi:10.1109/sfcs.1983.48 · Cited by 589
An asynchronous [(n - 1)/3]-resilient consensus protocol
Bracha, G. (1984) · Proceedings of the third annual ACM symposium on Principles of distributed computing - PODC '84 · doi:10.1145/800222.806743 · Cited by 293
Randomized Byzantine Agreements
Toueg, S. (1984) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800222.806744 · Cited by 159
'Eventual' is earlier than 'immediate'
Dolev, D., Reischuk, R., & Strong, H. R. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.51 · Cited by 57
Self-citationBounds on information exchange for Byzantine Agreement
Dolev, D., & Reischuk, R. (1982) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/800220.806690 · Cited by 47
Self-citation
Cited by
(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
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
Self-citationBitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Applications of Blockchains in the Internet of Things: A Comprehensive Survey
Ali, M. S., Vecchio, M., Pincheira, M., Dolui, K., Antonelli, F., & Rehmani, M. H. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2886932 · Cited by 855
Metadata
- Authors
- Dolev, D., Dwork, C., & Stockmeyer, L.
- Venue
- Journal of the ACM
- Published
- 1987-01
- Volume
- 34
- Issue
- 1
- Pages
- 77-97
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W1964729314
- Cited by
- 620
- References
- 12
- FWCI
- 25.00
- 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.