Welcome to cse138-notes’s documentation!

Contents:

• Introduction
  • Failures
  • Timeouts
  • Why?
• Time
  • Logical Clocks
  • Lamport Diagrams
  • Network Models
  • State and Events
  • Partial Order
  • Lamport Clocks
  • Vector Clocks
• Protocol
  • FIFO Delivery
  • Causal Delivery
  • Totally Ordered Delivery
• Snapshots of Distributed Systems
  • Chandy-Lamport Algorithm
• Safety & Liveness
  • Fault Models
  • Two Generals Problem
  • Fault Tolerance
  • Reliable Delivery, Take 2
  • Reliable Broadcast
• Replication
  • Primary-Backup Replication
  • Chain Replication
  • Total Order v. Determinism
  • Bad Things
  • Consistency
  • Coordination
  • Active v. Passive Replication
• Consensus
  • Properties
  • Paxos
  • Multi-Paxos
  • Paxos: Fault Tolerance
  • Other Consensus Protocols
• Consistency
  • Eventual Consistency
  • Misc
  • Quorum Consistency
• Dynamo
  • Concepts
  • Disagreements
  • Merkle Trees
  • Tail Latency
  • Sharding
  • Consistent Hashing
• Heterogeneous Distributed Systems
  • First-Order Distributed Systems
  • Heterogeneous
  • Monolith
  • Problems
  • Iteration 2
  • Business
  • Ideals + Rules of Thumb
  • Conclusion
• MapReduce
  • Online v. Offline Systems
  • MapReduce
  • Word Count
  • What Could Go Wrong
  • MapReduce @ Google
• Math
  • The Cost of Consensus
  • Strong Convergence
  • Upper Bounds
  • Examples

Acknowledgement

These notes are based on Lindsey Kuiper’s class on distributed systems (CSE 138) at UCSC. Lecture recordings can be found here.

Indices and tables

• Index

• Module Index

• Search Page