Skip to content
lectern.tv
1/4

Raft Log Compaction, Persistence & Linearizability (Part 2)

Robert MorrisDistinguishedMIT

Professor of Computer Science

1:17:36·2020·graduate level

Covers the subtle Figure 8 election safety restriction in Raft, crash recovery from persistent state, log snapshotting, and duplicate-RPC suppression for linearizable key-value stores.

Systems & CSDistributed SystemsRaftLinearizabilityCrash Recovery

Lecture 7: Fault Tolerance: Raft (2) MIT 6.824: Distributed Systems (Spring 2020)

Source: MIT 6.824: Distributed Systems via YouTubeWatch on YouTube
LecturerAll lecturers →
Robert MorrisDistinguished

MIT Professor of Computer Science & Member of the National Academy of Engineering

MIT Professor of Computer Science, Chord DHT co-inventor, Y Combinator co-founder, and architect of MIT 6.824 Distributed Systems.

2 courses · 41 lecturesCanon
Previous · Lecture 6

Consensus & Fault Tolerance — Raft (Part 1)

Next · Lecture 8

ZooKeeper — Wait-Free Coordination & Read Scaling

Comments

Add a comment...Sign in