Sign inSign in
ConceptSystems & CS

Partial order

A way of ordering events in a distributed system where some events have a defined sequence, but others are concurrent and unordered.
as Martin Kleppmann defines itUniversity of CambridgeThe wording closest to all 5 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

3

Each in their own terms, from the easiest level.

  • Martin Kleppmann

    University of Cambridge · Undergraduate

    • 8:00Causality & Lamport's Happens-Before Relation
    • 35:16Thinking in Events: From Databases to Distributed Collaboration Software
  • Vicky Neale

    University of Oxford · Undergraduate

    A relation that is reflexive, antisymmetric, and transitive is called a partial order.
    • 29:47Relations and Equivalence Relations
  • Bartosz Milewski

    Undergraduate

    An order relation that has no loops, meaning if there is an arrow from A to B, there cannot be an arrow from B to A.
    • 24:03Category Theory 3.1: Examples of Categories, Orders, Monoids

Lectures that assume it

9

Connections

23

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

3 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.