An upper and lower bound for clock synchronization
Jennifer Lundelius,Nancy Lynch +1 more
TLDR
It is proved that, even if the clocks all run at the same rate as real time and there are no failures, an uncertainty of e in the message delivery time makes it impossible to synchronize the clocks of n processes any more closely than e(1−1/ n ).Abstract:
The problem of synchronizing clocks of processes in a fully connected network is considered. It is proved that, even if the clocks all run at the same rate as real time and there are no failures, an uncertainty of e in the message delivery time makes it impossible to synchronize the clocks of n processes any more closely than e(1−1/ n ). A simple algorithm is given that achieves this bound.read more
Citations
More filters
Proceedings ArticleDOI
Max-min d-cluster formation in wireless ad hoc networks
TL;DR: A heuristic to form d-clusters in a wireless ad hoc network that tends to re-elect existing clusterheads even when the network configuration changes and has a tendency to evenly distribute the mobile nodes among the clusterheads, and evently distribute the responsibility of acting as clusterheads among all nodes.
Book
Information-Based Complexity
TL;DR: This book provides a comprehensive treatment of information-based complexity, the branch of computational complexity that deals with the intrinsic difficulty of the approximate solution of problems for which the information is partial, noisy, and priced.
Journal ArticleDOI
The time-triggered architecture
Hermann Kopetz,Günther Bauer +1 more
TL;DR: The architecture model of the TTA is presented, the design rationale is explained, the time-triggered communication protocols TTP/C andTTP/A are discussed, and how transparent fault tolerance can be implemented in the Tta is illustrated.
Proceedings ArticleDOI
The time-triggered architecture
TL;DR: An overview of the Time-Triggered Architecture is given, the architectural principles are discussed, the sensor/actuator interfaces in the TTA are described, the implementation of fault-tolerance is informed and the provision of fully specified interfaces between subsystems is described.
Journal ArticleDOI
Probabilistic clock synchronization
TL;DR: A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays and can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms.
References
More filters
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Proceedings ArticleDOI
A new fault-tolerant algorithm for clock synchronization
Jennifer Lundelius,Nancy Lynch +1 more
TL;DR: A new fault-tolerant algorithm for solving a variant of Lamport's clock synchronization problem for a system of distributed processes that communicate by sending messages, which solves the problem of maintaining closely synchronized local times, assuming that processes' local times are closely synchronized initially.
Proceedings ArticleDOI
Fault-tolerant clock synchronization
TL;DR: Two simple efficient distributed algorithms are given: one for keeping clocks in a network synchronized and one for allowing new processors to join the network with their clocks synchronized.
Proceedings ArticleDOI
On the possibility and impossibility of achieving clock synchronization
TL;DR: This work shows that clock synchronization is achievable, without authentication, as long as the faults do not disconnect the network, and provides a lower bound on the closeness to which simultaneity can be achieved in the network as a function of the transmission and processing delay properties of the network.