The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Open accessAbstract
A general method is described for implementing a distributed system with any desired degree of faulttolerance.Instead of relying upon explicit timeouts, processes execute a simple clock-driven algorithm.Reliable clock synchronization and a solution to the Byzantine Generals Problem are assumed.
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
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
Self-citationThe 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
Self-citationImpossibility 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
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
Self-citationThe notions of consistency and predicate locks in a database system
Eswaran, K. P., Gray, J. N., Lorie, R. A., & Traiger, I. L. (1976) · Communications of the ACM · doi:10.1145/360363.360369 · Cited by 1,956
Authenticated Algorithms for Byzantine Agreement
Dolev, D., & Strong, H. R. (1983) · SIAM Journal on Computing · doi:10.1137/0212045 · Cited by 654
The Byzantine generals strike again
Dolev, D. (1982) · Journal of Algorithms · doi:10.1016/0196-6774(82)90004-9 · Cited by 575
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
Self-citationSynchronizing clocks in the presence of faults
Lamport, L., & Melliar-Smith, P. M. (1985) · Journal of the ACM · doi:10.1145/2455.2457 · Cited by 543
Self-citationA lower bound for the time to assure interactive consistency
Fischer, M. J., & Lynch, N. A. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90033-3 · Cited by 519
The implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
Self-citationSynchronization in Distributed Programs
Schneider, F. B. (1982) · ACM Transactions on Programming Languages and Systems · doi:10.1145/357162.357163 · Cited by 142
Schneider, F. B., Gries, D. J., & Schlichting, R. D. (1984) · Science of Computer Programming · doi:10.1016/0167-6423(84)90009-1 · Cited by 84
A Simple and Efficient Byzantine Generals Algorithm.
Lynch, N., Fischer, M. J., & Fowler, R. J. (1982) · Defense Technical Information Center (DTIC) · doi:10.21236/ada113241 · Cited by 57
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
Self-citationPractical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
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 survey of rollback-recovery protocols in message-passing systems
Elnozahy, E. N. (., Alvisi, L., Wang, Y.-M., & Johnson, D. B. (2002) · ACM Computing Surveys · doi:10.1145/568522.568525 · Cited by 1,804
Metadata
- Authors
- Lamport, L.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1984-04
- Volume
- 6
- Issue
- 2
- Pages
- 254-280
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2061819031
- Cited by
- 335
- References
- 15
- FWCI
- 18.12
- 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.