Byzantine clock synchronization
Leslie Lamport, Peter Michael Melliar-Smith · ACM Symposium on Principles of Distributed Computing (PODC) · 1984
An informal description is given of three fault-tolerant clock-synchronization algorithms. These algorithms work in the presence of arbitrary kinds of failure, including “two-faced” clocks. Two of the algorithms are derived from Byzantine Generals solutions.
Cited by 115 works. doi:10.1145/800222.806737 Open-access PDF
Authors
References
- The Byzantine Generals Problem
- Reaching Agreement in the Presence of Faults
- The implementation of reliable distributed multiprocess systems
- The Byzantine generals strike again
- SIFT: Design and analysis of a fault-tolerant computer for aircraft control
- Synchronizing clocks in the presence of faults
- The Byzantine generals problem
- Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
- Fault-tolerant clock synchronization
- A new fault-tolerant algorithm for clock synchronization