Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
On the possibility and impossibility of achieving clock synchronization
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Applications of Byzantine agreement in database systems
ACM Transactions on Database Systems (TODS)
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Byzantine clock synchronization
ACM SIGOPS Operating Systems Review
The distributed firing squad problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Optimal precision in the presence of uncertainty
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Clock synchronization in distributed real-time systems
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Adding time to synchronous process communications
IEEE Transactions on Computers - Special Issue on Real-Time Systems
Non-byzantine clock synchronization—a programming experiment
ACM SIGOPS Operating Systems Review
Transmission Delays in Hardware Clock Synchronization
IEEE Transactions on Computers
Reliable scheduling in a TMR database system
ACM Transactions on Computer Systems (TOCS)
Investigations of fault-tolerant networks of computers
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The Accuracy of the Clock Synchronization Achieved by TEMPO in Berkeley UNIX 4.3BSD
IEEE Transactions on Software Engineering
IEEE Transactions on Computers
New Hybrid Fault Models for Asynchronous Approximate Agreement
IEEE Transactions on Computers
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Inexact agreement: accuracy, precision, and graceful degradation
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Exploiting Omissive Faults in Synchronous Approximate Agreement
IEEE Transactions on Computers
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part II
The Derivation and Experimental Verification of Clock Synchronization Theory
IEEE Transactions on Computers
Reaching Approximate Agreement with Mixed-Mode Faults
IEEE Transactions on Parallel and Distributed Systems
Probabilistic Clock Synchronization in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A brief history of NTP time: memoirs of an Internet timekeeper
ACM SIGCOMM Computer Communication Review
Adaptive clock synchronization in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Fault-Tolerant Cluster-Wise Clock Synchronization for Wireless Sensor Networks
IEEE Transactions on Dependable and Secure Computing
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
Century papers at the first quarter-century milestone
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Scalable synchronization of clocks in wireless sensor networks
Ad Hoc Networks
Constructing dependable certainty grids from unreliable sensor data
Robotics and Autonomous Systems
A theoretical evaluation of peer-to-peer internal clock synchronization
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Towards a real-time distributed computing model
Theoretical Computer Science
Consensus in the presence of partial synchrony (Preliminary Version)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
Electronic Notes in Theoretical Computer Science (ENTCS)
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Optimal gradient clock synchronization in dynamic networks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Optimal clock synchronization revisited: upper and lower bounds in real-time systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
The zerberus language: describing the functional model of dependable real-time systems
LADC'05 Proceedings of the Second Latin-American conference on Dependable Computing
Clock synchronization issues in multi-cluster time-triggered networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
| Hi-index | 0.02 |
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 a 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 the inital 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.