An upper and lower bound for clock synchronization

DOI10.1016/S0019-9958(84)80033-9zbMath0591.68023MaRDI QIDQ3719807

Jennifer Lundelius, Nancy A. Lynch

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

fully connected networkmessage delivery timesynchronizing clocks of processes

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items

On the possibility and impossibility of achieving clock synchronization, Optimal precision in the presence of uncertainty, 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, Verification of clock synchronization algorithms: experiments on a combination of deductive tools, A clock synchronization problem with random delays, Time is not a healer, Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds, Determination of Clock Synchronization Errors in Distributed Networks, Booting clock synchronization in partially synchronous systems with hybrid process and link failures, Probabilistic clock synchronization, Guaranteeing global synchronization in networks with stochastic interactions, Hundreds of impossibility results for distributed computing, Clock synchronization and the power of broadcasting, Reconciling fault-tolerant distributed algorithms and real-time computing, Gradient clock synchronization in dynamic networks, Towards a real-time distributed computing model, Self-stabilizing Byzantine clock synchronization with optimal precision, Linearizable read/write objects, Fault-tolerant algorithms for tick-generation in asynchronous logic, Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks, Trade-off results for connection management, Closed form bounds for clock synchronization under simple uncertainty assumptions