CSE138 (Distributed Systems) L6: Chandy-Lamport snapshot algorithm

CSE138 (Distributed Systems) L6: Chandy-Lamport snapshot algorithm
Share:

Download MP3


Similar Tracks

CSE138 (Distributed Systems) L7: safety and liveness, fault models, two generals problem Lindsey Kuper
CSE138 (Distributed Systems) L8: Chandy-Lamport snapshot algorithm Lindsey Kuper
Lecture 12: Distributed Transactions MIT 6.824: Distributed Systems
CSE138 (Distributed Systems) L2: time and clocks, causality and happens-before, network models Lindsey Kuper
CSE138 (Distributed Systems) L5: recap of FIFO/causal/TO delivery, implementing causal broadcast Lindsey Kuper
Distributed Systems 5.1: Replication Martin Kleppmann
CSE138 (Distributed Systems) L1: logistics/administrivia; distributed systems: what and why? Lindsey Kuper
CSE138 (Distributed Systems) L4: vector clocks, FIFO/causal/totally-ordered delivery Lindsey Kuper
Lecture 3: GFS MIT 6.824: Distributed Systems
CSE138 (Distributed Systems) L13: eventual consistency, availability, conflict resolution Lindsey Kuper
HS algorithm for Leader Election in Distributed Systems Arpit Bhayani
Distributed Systems 4.1: Logical time Martin Kleppmann
CSE138 (Distributed Systems) L11: more on consensus, the FLP result, the Paxos protocol Lindsey Kuper
Lecture 2: RPC and Threads MIT 6.824: Distributed Systems
CSE138 (Distributed Systems) L9: Chandy-Lamport wrap-up: limitations, assumptions, properties; ... Lindsey Kuper
CSE138 (Distributed Systems) L3: partial orders, total orders, Lamport clocks, vector clocks Lindsey Kuper
Distributed Systems 7.2: Linearizability Martin Kleppmann
CSE138 (Distributed Systems) L15: introduction to sharding; consistent hashing Lindsey Kuper
CSE138 (Distributed Systems) L10: determinism, consistency models, intro to consensus Lindsey Kuper