Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Journal of the ACM (JACM)
A new fault-tolerant algorithm for clock synchronization
Information and Computation
The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD
IEEE Transactions on Software Engineering
An overview of clock synchronization
Fault-tolerant distributed computing
Clock synchronization with faults and recoveries (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part III
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Understanding Protocols for Byzantine Clock Synchronization
Understanding Protocols for Byzantine Clock Synchronization
Brief announcement: linear time byzantine self-stabilizing clock synchronization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing clock synchronization in the presence of Byzantine faults
Journal of the ACM (JACM)
Designing Modular Services in the Scattered Byzantine Failure Model
ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Consensus When All Processes May Be Byzantine for Some Time
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Hi-index | 0.01 |
We consider the problem of synchronizing clocks in synchronous systems prone to transient and dynamic process failures, i.e., we consider systems where all processes may alternate correct and Byzantine behaviors. We propose a clock synchronization algorithm based on periodical resynchronizations which is based on the assumption that no more than f n/3 processes (with n the number of processors in the system) are simultaneously faulty. Both, accuracy (clocks being within a linear envelope of real-time) and precision (maximum deviation between clocks) perpetually hold for processes which sufficiently long follow their algorithm. We provide expressions for both the recovery time and the failure turn-over rates. Both expressions are independent of f, and are less than the time needed to execute 3 resynchronizations.