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.
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
2Each in their own terms, from the easiest level.
Martin Kleppmann
A logical timestamp consisting of a counter and a replica ID used to order events.Robert Morris
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.
Lectures that assume it
1Connections
8The lectures that define it or assume it, and the concepts next to it.