Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
Tolerating failures of continuous-valued sensors
ACM Transactions on Computer Systems (TOCS)
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Specification and Implementation of the Universal TimeCoordinated Synchronization Unit (UTCSU)
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part III
Interval-based Clock Synchronization
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part II
An interval-based framework for clock rate synchronization
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A Network Time Interface M-Module for Distributing GPS-Timeover LANs
Real-Time Systems - Selected papers from IFAC/IFIP workshops on real-time programming
The SimUTC Fault-Tolerant Distributed Systems Simulation Toolkit
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Maintaining the time in a distributed system: an example of a loosely-coupled distributed service (synchronization, fault-tolerance, debugging)
Practical uses of synchronized clocks in distributed systems
Distributed Computing
| Hi-index | 0.00 |
We propose a fault-tolerant algorithm for synchronizing both state and rate of clocks in a distributed system. This algorithm is based on rounds, uses our fault-tolerant Optimal Precision (OP) convergence function as the means of synchronization, and maintains a collection of intervals to keep track of real-time, internal global time, and clock rates. The analysis shows that the interlocking between state and rate synchronization can be easily solved, and that oscillator stabilities together with the transmission delay uncertainties of packets predominate the internal synchronization. In addition, average case results gathered from simulation experiments with our SimUTC toolkit prove to be about one order of magnitude better than the worst case ones from the analysis of our state and rate algorithm.