Closed form bounds for clock synchronization under simple uncertainty assumptions

DOI10.1016/S0020-0190(01)00151-XzbMath1032.68512OpenAlexW1984014506WikidataQ127656557 ScholiaQ127656557MaRDI QIDQ1603375

S. Biaz, Jennifer Lundelius Welch

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00151-x

zbMATH Keywords

Distributed computingLower boundClock synchronizationGeneralized hypercubeOptimal precision

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (8)

HEX: scaling honeycombs is easier than scaling clock trees ⋮ Improved time bounds for linearizable implementations of abstract data types ⋮ Gradient clock synchronization ⋮ Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach ⋮ Hundreds of impossibility results for distributed computing ⋮ Gradient clock synchronization in dynamic networks ⋮ Towards a real-time distributed computing model ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic

Cites Work

• Optimal precision in the presence of uncertainty
• A theory of clock synchronization (extended abstract)
• An upper and lower bound for clock synchronization
• Optimal clock synchronization under different delay assumptions

This page was built for publication: Closed form bounds for clock synchronization under simple uncertainty assumptions