Distributed Systems
Many machines that must agree with each other while the network between them drops, delays and splits.
Leader Election with Raft
Five servers and no boss. Timers run out, a candidate asks for votes, and a majority decides who leads.
Not started.Advanced12 minSplit Brain and Quorum
The network splits and both halves elect a leader. Requiring a majority is what prevents two histories.
Not started.Advanced10 minGossip Protocols
One server knows something. Each round, everyone who knows tells one other at random, and a million servers hear it within a few dozen rounds.
Not started.Intermediate8 minReplication and Replication Lag
Copies of the data on several servers. Writes go to one and are copied to the rest, and for a moment the copies disagree.
Not started.Intermediate10 minThe CAP Theorem
When the network splits, a system must either refuse some requests or risk giving different answers. It cannot avoid both.
Not started.Intermediate8 minTwo-Phase Commit
Two databases must both save a change, or neither. First everyone promises, then everyone commits, and there is one moment where it can get stuck.
Not started.Advanced9 minIdempotency and Safe Retries
The reply was lost, so the client sends the payment again. An idempotency key is what stops the customer being charged twice.
Not started.Intermediate8 min