Journal ArticleDOI
Probabilistic clock synchronization
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
Managing concurrent duties and time of wireless sensors in electrical power systems
TL;DR: This paper presents a new method for managing concurrent duties and time in low-power wireless sensor cells that monitor electrical power systems based on the co-operation of two interrupt levels generated locally in every sensor that is part of the cell.
Lumière: Byzantine View Synchronization.
TL;DR: The Byzantine View Synchronization problem is defined, which is responsible for eventually bringing all nodes to the same view for a sufficiently long time, and a third protocol is introduced, named Lumi\`ere, that has optimistically linear communication complexity and constant latency, and faced with benign failures, has expected linear communication and constantLatency.
Dissertation
Optimizing synchronization cost for mobile devices: the Expedient Trickle Sync algorithm
TL;DR: The results show that in many use scenarios, the ETS algorithm can indeed reduce the cost of data synchronization, and is evaluated alongside other optimistic replication algorithms in a custom developed simulation environment.
Proceedings ArticleDOI
GPS-based timing system for LAMOST
Xinqi Xu,Gangping Jin +1 more
TL;DR: A Net Time Server (NTS) that maintains the Coordinated Universal Time (UTC) derived from GPS, and distributes the time to precisely synchronize the client computer clocks across a network is described.
Um Serviço de Tempo Global para Sistemas Distribuídos de Larga Escala
TL;DR: In this article, the authors describe a time service for large-scale distributed systems that allows the integration of different clock synchronization algorithms which are adapted to the diversity of communication supports, available in the network.
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.