Thumbnail
Access Restriction
Subscribed

Author Lamport, Leslie
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Clock synchronization ♦ Distributed systems ♦ Computer networks ♦ Multiprocess systems
Abstract 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.
Description Affiliation: Massachusetts Computer Associates, Inc. (Lamport, Leslie)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 21
Issue Number 7
Page Count 8
Starting Page 558
Ending Page 565


Open content in new tab

   Open content in new tab
Source: ACM Digital Library