Distributed systems theory provides the mathematical and theoretical foundations for reasoning about distributed computation. Understanding these theorems and models is essential for making correct claims about consistency, availability, and correctness in systems that span multiple nodes.
Overview
mindmap
root((Distributed\nSystems Theory))
Fundamental Theorems
CAP Theorem
PACELC Theorem
FLP Impossibility
Two Generals Problem
Consensus Algorithms
Paxos
Raft
Viewstamped Replication
Practical Byzantine Fault Tolerance
Consistency Models
Linearizability
Sequential Consistency
Causal Consistency
Eventual Consistency
Read Your Writes
Time and Ordering
Physical Clocks
Logical Clocks - Lamport
Vector Clocks
Hybrid Logical Clocks
Distributed Coordination
Leader Election
Distributed Locks
Service Discovery
Distributed Transactions
Topics in This Section
| File | Topic | Key Concepts |
|---|---|---|
| 01_fundamental_theorems.md | Fundamental Theorems | CAP, PACELC, FLP, Two Generals |
| 02_consensus_algorithms.md | Consensus Algorithms | Raft, Paxos, Byzantine fault tolerance |
| 03_consistency_models.md | Consistency Models | Linearizability, causal, eventual |
| 04_time_ordering.md | Time and Ordering | Lamport clocks, vector clocks, HLC |
| 05_distributed_coordination.md | Distributed Coordination | Locks, leader election, service registry |