Synchronizing clocks in the presence of faults

DOI10.1145/2455.2457zbMath0629.68025OpenAlexW2118891797MaRDI QIDQ3766833

Leslie Lamport, P. Michael Melliar-Smith

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2455.2457

zbMATH Keywords

Byzantine failuresdistributed multiprocess system

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (20)

On the possibility and impossibility of achieving clock synchronization ⋮ Reliability versus cost: Design of a probabilistic broadcast algorithm ⋮ Gradient clock synchronization ⋮ On self-stabilizing wait-free clock synchronization ⋮ Combination of clock-state and clock-rate correction in fault-tolerant distributed systems ⋮ A new fault-tolerant algorithm for clock synchronization ⋮ Verification of clock synchronization algorithms: experiments on a combination of deductive tools ⋮ Time is not a healer ⋮ Self-adaptive clock synchronization for computational grid ⋮ Probabilistic clock synchronization ⋮ Using adaptive timeouts to achieve at-most-once message delivery ⋮ Hundreds of impossibility results for distributed computing ⋮ Clock synchronization and the power of broadcasting ⋮ Timed implementation relations for the distributed test architecture ⋮ Machine checked proofs of the design of a fault-tolerant circuit ⋮ Gradient clock synchronization in dynamic networks ⋮ Dynamic FTSS in asynchronous systems: the case of unison ⋮ Low-cost clock synchronization ⋮ Proving the correctness of client/server software ⋮ Necessary and sufficient conditions for broadcast consensus protocols.

This page was built for publication: Synchronizing clocks in the presence of faults