Optimal and efficient clock synchronization under drifting clocks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Trade-off results for connection management
Theoretical Computer Science
Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
Proceedings of the 13th International Symposium on Distributed Computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Gradient clock synchronization in dynamic networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Gradient Clock Synchronization Using Reference Broadcasts
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Optimal clock synchronization under energy constraints in wireless ad-hoc networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Achieve high accuracy of network time with proper parameters
Computer Communications
| Hi-index | 0.01 |
The problem of achieving optimal clock synchronization in a communication network with arbitrary topology and perfect clocks (that do not drift) is studied. Clock synchronization algorithms are presented for a large family of delay assumptions. Our algorithms are modular and consist of three major components. The first component holds for any type of delay assumptions; the second component holds for a large, natural family of local delay assumptions; the third component must be tailored for each specific delay assumption. Optimal clock synchronization algorithms are derived for several types of delay assumptions by appropriately tuning the third component. The delay assumptions include lower and upper delay bounds, no bounds at all, and bounds on the difference of the delay in opposite directions. In addition, our model handles systems where some processors are connected by broadcast networks in which every message arrives at all the processors at approximately the same time. A composition theorem allows combinations of different assumptions for different links or even for the same link; such mixtures are common in practice. Our results achieve the best possible precision in each execution. This notion of optimality is stronger than the more common notion of worst-case optimality. The new notion of optimality applies to systems where the worst-case behavior of any clock synchronization algorithm is inherently unbounded.