Clock synchronization in virtual rings

Author

Ciuffoletti, Augusto ; Gattai, Federica ; Golinelli, Roberta

Author_Institution

Dipartimento di Inf., Pisa Univ., Italy

fYear

1994

fDate

15-17 Jun 1994

Firstpage

72

Lastpage

77

Abstract

A probabilistic algorithm for external clock synchronization is proposed. The algorithm works under the assumption that it is possible to identify a virtual ring among the servers involved, and does not require an upper bound to message transmission delays. The approach is probabilistic, since clock synchronization is not guaranteed, but the probability of success can be made arbitrarily close to one. The precision is comparable with that achievable with other probabilistic protocols, with the advantage that all the nodes can synchronize their clocks within the same attempt. A Pascal-like description of the protocol is given, and a formal proof of its correctness is outlined

Keywords

clocks; delays; distributed algorithms; network operating systems; network servers; probability; program verification; protocols; real-time systems; synchronisation; Pascal-like description; correctness proof; distributed systems; external clock synchronization; message transmission delays; precision; probabilistic algorithm; program verification; protocol; real-time applications; time servers; virtual rings; Clocks; Communication networks; Delay; Hardware; Network servers; Operating systems; Protocols; Real time systems; Synchronization; Upper bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems, 1994. Proceedings., Sixth Euromicro Workshop on

Conference_Location

Vaesteraas

Print_ISBN

0-8186-6340-5

Type

conf

DOI

10.1109/EMWRTS.1994.336862

Filename

336862