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
Proceedings ArticleDOI
A Power management for probabilistic clock Synchronization in Wireless Sensor Networks
G.Y. Deng,F. Zhang +1 more
TL;DR: A model of probabilistic clock synchronization for sensor nodes is built and a trading-off between synchronization precision and energy consumption is supplied to illustrate such trade-off policies and show that the energy consumption can be reduced by sleep mode without drop the synchronization precision too much.
Proceedings ArticleDOI
Clock Synchronization in Clusters for Performance Evaluation: Numeric/Scientific Computing
TL;DR: This paper presents a toolset formed by a timing library and a clock synchronization library for a cluster to measure both execution and communication times in distributed environments for performance evaluation.
Proceedings ArticleDOI
Half-push/half-polling
TL;DR: The Half-Push/Half-Polling pattern as mentioned in this paper mixes these two different ways, keeping their advantages, eliminating their disadvantages, in order to eliminate the disadvantages of pushing and polling.
DissertationDOI
Consistent data replication in mobile ad hoc networks
TL;DR: A new class of data replication algorithms are introduced that provably guarantees update-linearizability in MANETs without using synchronized clocks on any pair of nodes in the system, which provides high availability of data.
A Non-Blocking Atomic-Multicast Service for Scalable In-memory Transaction Systems
TL;DR: Extensive performance study confirms best crash-free performance, crashuninterrupted service and no delivery failure in practical settings.
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.