Synchronizing clocks in the presence of faults
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Distributed Computing
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Communications of the ACM
A new fault-tolerant algorithm for clock synchronization
Information and Computation
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
Fault-tolerant clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Observable clock synchronization extended abstract
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
CesiumSpray: a Precise and Accurate Global Time Servicefor Large-scale Systems
Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part III
Time synchronization methods for wireless sensor networks: A survey
Programming and Computing Software
| Hi-index | 0.00 |
We investigate the power of a broadcast mechanism in a distributed network. We do so by considering the problem of synchronizing clocks in an error-free network, under the assumption that there is no upper bound on message transmission time, but that broadcast messages are guaranteed to be received within an interval of size ε, for some fixed constant ε. This is intended to be an idealization of what happens in multiple access networks, such as the Ethernet. We then consider tradeoffs between the type and number of broadcasts, and the tightness of synchronization. Our results include (1) matching upper and lower bounds of (1 + 1/K;)ε on the precision of clock synchronization attainable for n ≥ 3 process using K (n - 1)-casts, 3 ≥ K ≥ n, (2) matching upper and lower bounds of (1 + 1/n;)ε on the precision of clock synchronization attainable for n ≥ 3 processes using an arbitrary number of (n - 1)-casts, and (3) matching upper and lower bounds of (1 + n - 2/n)ε on the precision attainable using 2-casting.