Tight bounds for clock synchronization

  title={Tight bounds for clock synchronization},
  author={C. Lenzen and T. Locher and Roger Wattenhofer},
  journal={J. ACM},
We present a novel clock synchronization algorithm and prove tight upper and lower bounds on the worst-case clock skew that may occur between any two participants in any given distributed system. More importantly, the worst-case clock skew between neighboring nodes is (asymptotically) at most a factor of two larger than the best possible bound. While previous results solely focused on the dependency of the skew bounds on the network diameter, we prove that our techniques are optimal also with… Expand
67 Citations
Lecture 2 Lower Bound on the Local Skew
  • 2018
  • PDF
Optimal gradient clock synchronization in dynamic networks
  • 33
  • PDF
Fault Tolerant Gradient Clock Synchronization
  • PDF
PulseSync: An Efficient and Scalable Clock Synchronization Protocol
  • 95
  • PDF
D C ] 2 1 Fe b 20 19 Fault Tolerant Gradient Clock Synchronization
Efficient and Discrete Gradient Synchronization
  • Highly Influenced
Gradient Clock Synchronization in Dynamic Networks
  • 35
  • PDF