scispace - formally typeset
Journal ArticleDOI

Probabilistic clock synchronization

Flaviu Cristian
- 01 Sep 1989 - 
- Vol. 3, Iss: 3, pp 146-158
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

Content maybe subject to copyright    Report

Citations
More filters

Dynamically Configuring Communication Services with the Service Configurator Pattern

TL;DR: A rapidly growing collection of communication services are now available on the Internet, including WWW browsing and content retrieval services, software distribution services, and request brokerage services.
Journal ArticleDOI

An optimistic obsolescence-based approach to event synchronization for massively multiplayer online games

TL;DR: This work considers a mirrored game server architecture and presents a mechanism aimed at accelerating the delivery of game events generated during game sessions, which rests upon the use of an optimistic synchronization mechanism that exploits the semantics of the game to diminish the delivery time ofgame events, whilst maintaining the full consistency of thegame state.
Proceedings ArticleDOI

A scalable ordering primitive for multicore machines

TL;DR: The proposed Ordo primitive frees various logical timestamp-based algorithms from the burden of the software logical clock, while trying to simplify their design, and generally improves the efficiency of several algorithms by 1.2--39.7X on various architectures.
Journal ArticleDOI

Synchronized UTC for Distributed Real-Time Systems

TL;DR: A novel technique for establishing a highly accurate global time in fault-tolerant, large-scale distributed real-time systems that requires only a few high-accurate external time sources and provides each node with the actual accuracy of its clock.

Consensus and Membership in Synchronous and Asynchronous Distributed Systems

TL;DR: This paper surveys two fundamental agreement problems that must be solved in dependable distributed systems and considers the existing literature on consensus and membership protocols designed according to various assumptions and the advantages and drawbacks of the different approaches.
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

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

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

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.
Related Papers (5)