Skip to content
lectern.tv
Editorial path·Systems & CS·graduate·3 institutions

Distributed Consensus, Clocks & Storage Engines

From unreliable networks and physical time to Raft and page-level durability

Pairs MIT 6.824, Cambridge Distributed Systems, and CMU Database Internals to show how distributed consensus protocols and local storage engines cooperate under partial failure.

Start Step 17 steps · 6h total

Curriculum sequence

7
Step 1·MIT·Robert Morris·6.824· 1:19:35

MIT 6.824 Distributed Systems: Introduction & MapReduce

Frames fault tolerance, replication, and scalable computation in distributed clusters.

Step 2·University of Cambridge·Martin Kleppmann·CST-DS· 19:44

Distributed Systems 1.3: RPC (Remote Procedure Call)

Dissects RPC semantics, network partitions, and retry idempotence.

Step 3·University of Cambridge·Martin Kleppmann·CST-DS· 20:47

Distributed Systems 3.1: Physical time

Explains quartz drift and why wall-clock timestamps cannot order distributed events.

Step 4·University of Cambridge·Martin Kleppmann·CST-DS· 15:57

Distributed Systems 3.2: Clock synchronisation

Bounds clock skew and synchronization uncertainty across machines.

Step 5·MIT·Robert Morris·6.824· 1:17:36

MIT 6.824 Lecture 7: Raft Log Compaction, Persistence & Linearizability (Part 2)

Walks through Raft log compaction, crash recovery, and linearizable reads.

Step 6·Carnegie Mellon University·Andy Pavlo·15-445· 1:16:43

CMU 15-445 #01: The Relational Model & Relational Algebra

Grounds state-machine storage in the relational model and algebraic query plans.

Step 7·Carnegie Mellon University·Andy Pavlo·15-445· 1:22:44

CMU 15-445 #06: Buffer Pool Managers, LRU-K Eviction & Direct I/O

Connects durability guarantees to buffer pools, eviction policies, and direct I/O.