Sign inSign in
ConceptSystems & CS

Lamport clock

A logical clock algorithm where each node maintains a local counter that increments on local events and gets updated upon message receipt to track causal relationships.
as Martin Kleppmann defines itUniversity of CambridgeThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Martin Kleppmann

    University of Cambridge · Undergraduate

    A logical timestamp consisting of a counter and a replica ID used to order events.
    • 37:03Thinking in Events: From Databases to Distributed Collaboration Software
  • Robert Morris

    MIT · Undergraduate

    A method for assigning timestamps to events in a distributed system that maintains causality and handles clock skew by using the maximum of the highest seen timestamp plus one and the local wall clock time.
    • 24:50COPS, Causal Consistency

Lectures that assume it

1

Connections

8

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.