The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Consensus in the presence of partial synchrony
Open accessAbstract
The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper bound Δ on the time required for a message to be sent from one processor to another and a known fixed upper bound Φ on the relative speeds of different processors. In an asynchronous system no fixed upper bounds Δ and Φ exist. In one version of partial synchrony, fixed bounds Δ and Φ exist, but they are not known a priori. The problem is to design protocols that work correctly in the partially synchronous system regardless of the actual values of the bounds Δ and Φ. In another version of partial synchrony, the bounds are known, but are only guaranteed to hold starting at some unknown time T , and protocols must be designed to work correctly regardless of when time T occurs. Fault-tolerant consensus protocols are given for various cases of partial synchrony and various fault models. Lower bounds that show in most cases that our protocols are optimal with respect to the number of faults tolerated are also given. Our consensus protocols for partially synchronous processors use new protocols for fault-tolerant “distributed clocks” that allow partially synchronous processors to reach some approximately common notion of time.
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
Self-citationTime, clocks, and the ordering of events in a distributed system
Massachusetts Computer Associates, I., & Lamport, L. (2019) · Concurrency: the Works of Leslie Lamport · doi:10.1145/3335772.3335934 · Cited by 1,979
Notes on data base operating systems
Gray, J. N. (1978) · Lecture Notes in Computer Science · doi:10.1007/3-540-08755-9_9 · Cited by 1,656
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
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
Self-citationReaching 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
Self-citationAsynchronous consensus and broadcast protocols
Bracha, G., & Toueg, S. (1985) · Journal of the ACM · doi:10.1145/4221.214134 · Cited by 513
The 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
Byzantine generals in action: implementing fail-stop processors
Schneider, F. B. (1984) · ACM Transactions on Computer Systems · doi:10.1145/190.357399 · Cited by 266
The Weak Byzantine Generals Problem
Lamport, L. (1983) · Journal of the ACM · doi:10.1145/2402.322398 · Cited by 221
Simulating authenticated broadcasts to derive simple fault-tolerant algorithms
Srikanth, T. K., & Toueg, S. (1987) · Distributed Computing · doi:10.1007/bf01667080 · Cited by 221
An efficient algorithm for byzantine agreement without authentication
Dolev, D., Fischer, M. J., Fowler, R., Lynch, N., & Strong, H. R. (1982) · Information and Control · doi:10.1016/s0019-9958(82)90776-8 · Cited by 149
Self-citationByzantine Generals and Transaction Commit Protocols
Lamport, L., & Fischer, M. J. (1982) · Cited by 111
Knowledge and Common Knowledge in a Byzantine Environment I: Crash failures
Dwork, C., & Moses, Y. (1986) · Elsevier eBooks · doi:10.1016/b978-0-934613-04-0.50013-2 · Cited by 69
Self-citationA new solution for the Byzantine generals problem
Reischuk, R. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80042-5 · Cited by 60
Cited by
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
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
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_12 · Cited by 1,459
The Quest for Scalable Blockchain Fabric: Proof-of-Work vs. BFT Replication
Vukolić, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-39028-4_9 · Cited by 1,051
“The safety properties of consensus, including consensus finality, are maintained despite global communication outages and arbitrarily long asynchrony periods [20].”
Metadata
- Authors
- Dwork, C., Lynch, N., & Stockmeyer, L.
- Venue
- Journal of the ACM
- Published
- 1988-04
- Volume
- 35
- Issue
- 2
- Pages
- 288-323
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2003214215
- Cited by
- 1,909
- References
- 18
- FWCI
- 17.21
- 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.