Tight bounds for clock synchronization

DOI10.1145/1667053.1667057zbMath1327.68045OpenAlexW2038591001WikidataQ56610574 ScholiaQ56610574MaRDI QIDQ3578187

Thomas Locher, Christoph Lenzen, Roger Wattenhofer

Publication date: 14 July 2010

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1667053.1667057

zbMATH Keywords

worst-case analysisbounded ratesglobal skewgradient propertylocal skewvariable clock drifts

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (5)

HEX: scaling honeycombs is easier than scaling clock trees ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach ⋮ Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic

This page was built for publication: Tight bounds for clock synchronization