Journal Article10.1007/BF01784024
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.
read more
Abstract: A probabilistic method is proposed for reading remote clocks in distributed systems subject to unbounded random communication delays. The method can achieve clock synchronization precisions superior to those attainable by previously published clock synchronization algorithms. Its use is illustrated by presenting a time service which maintains externally (and hence, internally) synchronized clocks in the presence of process, communication and clock failures.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Fine-grained network time synchronization using reference broadcasts
Jeremy Elson,Lewis Girod,Deborah Estrin +2 more
- 09 Dec 2002
TL;DR: Reference Broadcast Synchronization (RBS) as discussed by the authors is a scheme in which nodes send reference beacons to their neighbors using physical-layer broadcasts, and receivers use their arrival time as a point of reference for comparing their clocks.
•Book
Parallel and Distributed Simulation Systems
Richard M. Fujimoto
- 01 Jan 2000
TL;DR: The article gives an overview of technologies to distribute the execution of simulation programs over multiple computer systems, with particular emphasis on synchronization (also called time management) algorithms as well as data distribution techniques.
Clock synchronization for wireless sensor networks: a survey
Bharath Sundararaman,Ugo Buy,Ajay D. Kshemkalyani +2 more
- 01 May 2005
TL;DR: In this paper, a survey and evaluation of clock synchronization protocols based on a palette of factors such as precision, accuracy, cost, and complexity is presented, which can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor network application.
•Book
Pattern-Oriented Software Architecture, Patterns for Concurrent and Networked Objects
Douglas C. Schmidt,Michael Stal,Hans Rohnert,Frank Buschmann +3 more
- 14 Sep 2000
TL;DR: The patterns catalogued in this second volume of Pattern-Oriented Software Architectures (POSA) form the basis of a pattern language that addresses issues associated with concurrency and networking.
•Journal Article
Time synchronization in wireless sensor networks
Jeremy Elson,Deborah Estrin +1 more
TL;DR: In this article, a service model for time synchronization is proposed to better support the broad range of application requirements seen in sensor networks, while meeting the unique resource constraints found in such systems.
References
Clock Synchronization in Distributed Real-Time Systems
TL;DR: Depending on the types and number of tolerated faults, this paper presents upper bounds on the achievable synchronization accuracy for external and internal synchronization in a distributed real-time system.
656
Synchronizing clocks in the presence of faults
TL;DR: Three algorithms for maintaining clock synchrony in a distributed multiprocess system where each process has its own clock work in the presence of arbitrary clock or process failures, including “two-faced clocks” that present different values to different processes.
Optimal clock synchronization
T. K. Srikanth,Sam Toueg +1 more
TL;DR: This is the first known solution that achieves optimal accuracy—the accuracy of synchronized clocks (with respect to real time) is as good as that specified for the underlying hardware clocks.
A new fault-tolerant algorithm for clock synchronization
Jennifer Lundelius,Nancy Lynch +1 more
- 27 Aug 1984
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.
A new fault-tolerant algorithm for clock synchronization
Jennifer L. Welch,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 that maintains synchronization to within a small constant, whose magnitude depends upon the rate of clock drift, the message delivery time and its uncertainty.
297