Time, clocks, and the ordering of events in a distributed system

@article{Lamport1978TimeCA,
  title={Time, clocks, and the ordering of events in a distributed system},
  author={L. Lamport},
  journal={Commun. ACM},
  year={1978},
  volume={21},
  pages={558-565}
}
  • L. Lamport
  • Published 1978
  • Computer Science
  • Commun. ACM
  • 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. [...] Key Method 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.Expand Abstract

    Figures and Topics from this paper.

    Virtual time
    • 2,237
    • Open Access
    Timestamps in Message-Passing Systems That Preserve the Partial Ordering
    • 713
    • Highly Influenced
    • Open Access
    Distributed snapshots: determining global states of distributed systems
    • 2,679
    • Open Access
    Exploiting virtual synchrony in distributed systems
    • 779
    • Open Access
    An Efficient Implementation of Vector Clocks
    • 181
    An Overview of Clock Synchronization
    • 122
    • Open Access
    Logical Time: Capturing Causality in Distributed Systems
    • 244
    Concurrency Control in Distributed Database Systems
    • 1,121
    • Open Access

    References

    Publications referenced by this paper.
    Relativity in lllustrations
    • 1962