Distributed Systems Fundamentals

The timeless distributed-systems fundamentals every architect must reason from — the impossibility/tradeoff results (CAP, PACELC, FLP, the fallacies of distributed computing), consensus (Paxos, Raft leader election & log replication, ZAB/Viewstamped Replication, quorums), replication & consistency models (single/multi/leaderless, linearizability → causal → eventual, read-your-writes, R+W>N quorums, LWW/vector clocks/CRDTs), partitioning/consistent hashing, caching & stampede, queues & the log (at-least/exactly-once, idempotency, outbox), time & logical/vector/hybrid clocks, cross-node transactions (2PC, sagas, isolation levels, the dual-write problem), and failure/reliability (failure detectors, retries/backoff/jitter, fencing tokens, backpressure). Use when designing or reviewing any replicated, sharded, multi-region, or fault-tolerant system; choosing a consistency model; doing leader election or distributed locking; debugging split-brain, stale reads, lost updates, clock-skew bugs, duplicate processing, or

sanjeevrg89 Updated 0 repo stars

File contents

sanjeevrg89/arete commit dcf66785bc

Frequently asked questions

npx get-skill add sanjeevrg89/distributed-systems-fundamentals