Consensus
Algorithms for agreeing on a single value across nodes.
Most pages on the site touch several concepts. This page goes the other way — pick a concept, see every page that covers it. Use it to jump sideways: read the Spanner paper, then the consistent-hashing simulator, then the load-balancing deep dive on Maglev, all under one tag.
Pick one if you don't know where to begin. Each one of these connects to a half-dozen other topics on this page.
Algorithms for agreeing on a single value across nodes.
The trade-off between consistency, availability, and partition tolerance.
Mapping keys to nodes so adding or removing a node only moves K/N keys.
Ordering events without synchronised real time.
Data types where concurrent updates merge without coordination.
Strategies for copying data — leader-follower, multi-master, gossip.
Replacing distributed transactions with idempotent steps and compensations.
Consensus that survives malicious — not just crashed — participants.
The canonical disk-backed index structure used by most relational databases.
Write-optimised storage — appends to memory, merges to sorted disk runs.
How databases survive crashes — log first, page later.
What every "Serializable" actually means, and where the anomalies hide.
Multi-version concurrency control — every read sees a snapshot.
Where each layer — browser, CDN, app, database — earns its keep.
Splitting a dataset across nodes — by range, hash, or directory.
Why analytical queries scan columns, not rows — and 10× faster.
When two-phase commit blocks, sagas help, and Spanner+Calvin do something different.
Reliable byte streams over best-effort packet delivery.
The handshake under the lock — keys, certificates, forward secrecy.
How names resolve from your resolver out to the root.
Request, response, methods, headers, status codes — and the three major versions.
TCP's head-of-line problem, solved at the protocol level.
How the internet learns where to send a packet.
L4 vs L7, algorithms, anycast, consistent hashing, graceful drain.
PoPs, anycast, cache keys, origin shielding — the internet's middle layer.
Why p99 matters more than the average when requests fan out.
Diagnosing systems from the outside — Brendan Gregg's USE, Tom Wilkie's RED.
Little's Law and the math behind every saturation curve.
Finding where the CPU actually goes — sampling, instrumentation, flame graphs.
Stack, heap, arena, garbage collection — where every malloc actually goes.
Threads, channels, event loops, lock-free structures.
Namespaces, cgroups, layers, runtimes — the Linux process with its own world.
The papers and architectures that shaped modern operating systems.
Letting an app act on the user's behalf without their password.
Channels, goroutines, the scheduler, escape analysis, interfaces.
BFS, DFS, shortest paths, max-flow, topological sort.
Overlapping subproblems, memoisation, the canonical patterns.
Trees, hashes, heaps, tries — operations and Big-O for each.
20 canonical patterns for the interview class of algorithm problems.
API server, scheduler, kubelet, etcd, CRDs.
Logical clocks, Paxos, Byzantine Generals, TLA+.
GFS, MapReduce, Bigtable, Spanner, F1, Borg, Maglev.
This index is hand-curated. If you searched for something and didn't find it, it probably isn't covered yet — or it's covered under a different name. Try ⌘K search as the fallback, or browse the glossary for a quick definition.
Looking for a study order, not a tag dump? The senior-SWE roadmap walks the same topics in a sensible sequence.