Time, Clocks, and the Ordering of Events in a Distributed System

Last modified by Andrea Omicini on 01/05/2021 16:48

Leslie Lamport

The concept of one event happening before another in a distributed system is examined, and is shown to define a partial ordering of the events. A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events. The use of the total ordering is illustrated with a method for solving synchronization problems. The algorithm is then specialized for synchronizing physical clocks, and a bound is derived on how far out of synchrony the clocks can become.

Communications of the ACM 21(7), pages 558-565, 1978, ACM, New York, NY, USA
@article{lamport-acmcomm21,
Address = {New York, NY, USA},
Author = {Lamport, Leslie},
Doi = {10.1145/359545.359563},
Issn = {0001-0782},
Journal = {Communications of the ACM},
Number = 7,
Pages = {558--565},
Publisher = {ACM},
Title = {Time, Clocks, and the Ordering of Events in a Distributed System},
Url = {http://portal.acm.org/citation.cfm?id=359563},
Volume = 21,
Year = 1978}

    

Publication Data

Status
Published

IDs

(DOI)
10.1145/359545.359563

Links
Original Page

Biblio

(Print ISSN)
0001-0782

BibTeX

(BibTeX ID)
lamport-acmcomm21
(BibTeX Category)
article

2011 © aliCE Research Group @ DEIS, Alma Mater Studiorum-Università di Bologna
1.1