A new fault-tolerant algorithm for clock synchronization
We describe a new fault-tolerant algorithm for solving a variant of Lamport's clock synchronization problem. The algorithm is designed for a system of distributed processes that communicate by sending messages. Each process has its own read-only physical clock whose drift rate from real time is very small. By adding a value to its physical clock time, the process obtains its local time. The algorithm solves the problem of maintaining closely synchronized local times, assuming that processes' local times are closely synchronized initially. The algorithm is able to tolerate the failure of just under one-third of the participating processes. It maintains synchronization to within a small constant, whose magnitude depends upon the rate of clock drift, the message delivery time and its uncertainty, and the initial closeness of synchronization. We also give a characterization of how far the clocks drift from real time. Reintegration of a repaired process can be accomplished using a slight modification of the basic algorithm. A similar style algorithm can also be used to achieve synchronization initially.
- Proving the correctness of client/server software
- A distributed algorithm to prevent mutual drift between n logical clocks
- Clock synchronization and the power of broadcasting
- Low-cost clock synchronization
- Interval-based clock synchronization with optimal precision.
- A new synchronization algorithm for VHDL-AMS simulation
- The customizable fault/error model for dependable distributed systems.
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Demonstration of multiparty quantum clock synchronization
- Approximate partial order reduction
- Gradient clock synchronization
- The Theta-Model: achieving synchrony without clocks
- Computational aspects of uncertainty profiles and angel-daemon games
- Synchronizing clocks in the presence of faults
- A simple algorithm for clock synchronization in transputer networks
- Dynamic fault-tolerant clock synchronization
- Determination of clock synchronization errors in distributed networks
- On self-stabilizing wait-free clock synchronization
- Fast multidimensional asymptotic and approximate consensus
- How to reconcile fault-tolerant interval intersection with the Lipschitz condition
- Hundreds of impossibility results for distributed computing
- Clock synchronization with faults and recoveries (extended abstract)
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Permissionless clock synchronization with public setup
- Strong order-preserving renaming in the synchronous message passing model
- A topological characterization of stabilizing consensus
- Combination of clock-state and clock-rate correction in fault-tolerant distributed systems
- Probabilistic clock synchronization
This page was built for publication: A new fault-tolerant algorithm for clock synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104072)
