The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Synchronizing clocks in the presence of faults
Open accessAbstract
Algorithms are described for maintaining clock synchrony in a distributed multiprocess system where each process has its own clock. These algorithms work in the presence of arbitrary clock or process failures, including “two-faced clocks” that present different values to different processes. Two of the algorithms require that fewer than one-third of the processes be faulty. A third algorithm works if fewer than half the processes are faulty, but requires digital signatures.
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
Self-citationReaching 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-citationAuthenticated 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-citationUsing Time Instead of Timeout for Fault-Tolerant Distributed Systems.
Lamport, L. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/2993.2994 · Cited by 335
Self-citationThe implementation of reliable distributed multiprocess systems
Lamport, L. (1978) · Computer Networks (1976) · doi:10.1016/0376-5075(78)90045-4 · Cited by 233
Self-citationOn the possibility and impossibility of achieving clock synchronization
Dolev, D., Halpern, J. Y., & Strong, H. R. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90028-0 · Cited by 139
SIFT: design and analysis of a fault-tolerant computer for aircraft control
Wensley, J. H., Lamport, L., Goldberg, J., Member, S., Green, M. W., Levi'it, K. N., Melliar-Smith, P. M., Shostak, R. E., Charles, & Weinstock, B. (1979) · Microelectronics Reliability · doi:10.1016/0026-2714(79)90211-7 · Cited by 82
Self-citation
Cited by
Internet time synchronization: the network time protocol
Mills, D. L. (1991) · IEEE Transactions on Communications · doi:10.1109/26.103043 · Cited by 1,859
The TESLA Broadcast Authentication Protocol
Perrig, A., Canetti, R., Tygar, J. D., & Song, D. X. (2018) · Figshare · doi:10.1184/r1/6073610 · Cited by 842
Probabilistic clock synchronization
Cristian, F. (1989) · Distributed Computing · doi:10.1007/bf01784024 · Cited by 595
Clock Synchronization in Distributed Real-Time Systems
Kopetz, H., & Ochsenreiter, W. (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.5009516 · Cited by 572
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
Owre, S., Rushby, J., Shankar, N., & von Henke, F. (1995) · IEEE Transactions on Software Engineering · doi:10.1109/32.345827 · Cited by 493
Metadata
- Authors
- Lamport, L., & Melliar-Smith, P. M.
- Venue
- Journal of the ACM
- Published
- 1985-01
- Volume
- 32
- Issue
- 1
- Pages
- 52-78
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2118891797
- Cited by
- 543
- References
- 9
- FWCI
- 19.17
- 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.