Journal ArticleDOI
Probabilistic clock synchronization
Reads0
Chats0
TLDR
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.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
Citations
More filters
Journal ArticleDOI
A Comparison of Clock Synchronization in Wireless Sensor Networks
TL;DR: A comparison of different clock synchronization algorithms in wireless sensor networks with a main focus on energy efficiency, scalability, and precision properties of them will be provided here.
Probabilistic Clock Synchronization Service in Sensor Networks
TL;DR: This paper extends the Reference Broadcast Synchronization protocol to provide a probabilistic bound on the accuracy of the clock synchronization service, allowing for a tradeoff between accuracy and resource requirement.
Proceedings ArticleDOI
Early-delivery atomic broadcast
TL;DR: This paper presents early-delivery atomic broadcast protocols for systems in which processors are subject to arbitrary failures, but have access to a message authentication facility and uses time explicitly in the protocols.
Interactivity Maintenance for Event Synchronization in Massive Multiplayer Online Games
TL;DR: A loosely coupled distributed architecture where several servers (named Game State Servers or GSSs) are geographically distributed over the Internet is suggested to provide support to the development of interactive multiplayer networked game applications.
Journal ArticleDOI
Fault-tolerant clock synchronization in large multicomputer systems
A. Olson,Kang G. Shin +1 more
TL;DR: This work shows how to reduce the cost of synchronization by assigning each node to one or more groups, then having each node estimate the clock values of only those nodes with which it shares a group.
References
More filters
Journal ArticleDOI
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.
Journal ArticleDOI
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.
Journal ArticleDOI
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.
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.
Journal ArticleDOI
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.