Synchronizing clocks in the presence of faults
- 1 January 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 32 (1), 52-78
- https://doi.org/10.1145/2455.2457
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.ACM Transactions on Programming Languages and Systems, 1984
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980