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.
Keywords
Affiliated Institutions
Related Publications
Time, clocks, and the ordering of events in a distributed system
research-article Share on Time, clocks, and the ordering of events in a distributed system Author: Leslie Lamport Massachusetts Computer Associates, Inc. Massachusetts Computer ...
Dissemination of System Time
This paper considers the problem of estimating the offset in timing of like events at geographically separated locations as a basis for establishing common knowledge of time and...
A distributed alternative to finite-state-machine specifications
A specification technique, formally equivalent to finite-state machines, is offered as an alternative because it is inherently distributed and more comprehensible. When applied ...
An architecture for parallel topic models
This paper describes a high performance sampling architecture for inference of latent topic models on a cluster of workstations. Our system is faster than previous work by over ...
Surface codes: Towards practical large-scale quantum computation
This article provides an introduction to surface code quantum computing. We\nfirst estimate the size and speed of a surface code quantum computer. We then\nintroduce the concept...
Publication Info
- Year
- 1978
- Type
- article
- Volume
- 21
- Issue
- 7
- Pages
- 558-565
- Citations
- 8350
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1145/359545.359563