Lower bounds for convergence function based clock synchronization

DOI10.1145/224964.224980MaRDI QIDQ5361447zbMATH OpenOpenAlexFDO

Authors Christof Fetzer, Flaviu Cristian

Publication date 29 September 2017

Published in Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cited in

(3)

• Hundreds of impossibility results for distributed computing
• Interval-based clock synchronization with optimal precision.
• Booting clock synchronization in partially synchronous systems with hybrid process and link failures

This page was built for publication: Lower bounds for convergence function based clock synchronization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361447)