Category
Consensus, locks, transactions, fault tolerance, and distributed algorithms.
11 articles
The saga pattern explained: long-lived business transactions as local steps with compensating transactions, orchestration vs choreography, the transactional outbox that fixes the dual write, and the…
Distributed locks explained: leases and TTLs as mutual exclusion across machines; the Redis distributed lock and its failover…
Fault tolerant system design: failure models from crash to byzantine, redundancy and the N+1 arithmetic, the failover playbook,…
Distributed transactions explained: two-phase commit step by step, the 2pc coordinator failure that leaves participants in doubt, consensus-backed…
Leader election in distributed systems explained: leader election algorithms from the bully algorithm to quorum voting, zookeeper leader…
The Paxos algorithm explained: the paxos roles (proposers, acceptors, and learners) how prepare and accept ballots run, the…
The Raft consensus algorithm explained: raft leader election with randomized timeouts, raft log replication through a strong leader,…
Consensus algorithms compared: Paxos and Multi-Paxos, the raft vs paxos difference, ZAB inside ZooKeeper, and byzantine fault tolerant…
Distributed consensus explained: the consensus problem, why agreement is hard under partial failure, the quorum math behind majority…
Consistent hashing explained: the hash ring, virtual nodes, and the rendezvous hashing alternative; the placement scheme that lets…
What makes a system distributed: several machines cooperating over a network, partial failure as the defining property, no…