Computer Science · MapleScholar Plus

The Domino Clock: How Leslie Lamport Taught Distributed Computers the True Meaning of Time

Physical clocks drift out of sync across distributed computer networks because electrical signals cannot travel faster than the speed of light; Leslie Lamport defined time through cause-and-effect causality rather than ticking seconds. Published in 1978, Lamport’s logical clock paper is the most cited work in distributed systems, establishing the foundational physics of cloud computing.

Author
Leslie Lamport
Published
1978
Journal
Communications of the ACM
Last updated
September 2026
The Domino Clock: How Leslie Lamport Taught Distributed Computers the True Meaning of Time

In distributed computing, when thousands of servers across different continents manage financial trades or multiplayer video games, wall clocks on individual servers constantly drift apart by milliseconds. If two users click a button at the exact same moment, computers cannot agree on who went first.

Leslie Lamport realized that physical wall clocks are meaningless across distributed networks. Instead of measuring seconds, Lamport created "logical clocks" based on causality: like falling dominoes, an event only happens after the message that caused it was sent, creating an unshakeable order of cause and effect.

Lamport's paper became the theoretical cornerstone of cloud computing. By keeping global database clusters in sync, by powering distributed cloud giants like AWS and Google Cloud, and by enabling decentralized blockchains, logical clocks keep the distributed internet orderly.

Reference

Lamport, L. (1978). Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7), 558–565.

Title

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

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.

Cited 8,458 times · View on doi.org

Continue

Continue Exploring

Ask this paper your own questions, or keep browsing the verified research catalogue.