1·www.artima.com
Why Distributed Computing?
Why I added thisBegin with the reasons systems are distributed even when centralization looks simpler.
A CURATED READING LIST
Distributed Systems Fundamentals: Essential Reading
Start with the reasons software ends up distributed, then work through the consequences for latency, reliability, and service boundaries. These readings suit engineers who have built applications but want a firmer basis for decisions involving multiple machines. Waldo and Grigorik establish practical constraints. The end-to-end paper explains where guarantees belong, while Helland makes the boundary between local data and exchanged data explicit. Hamilton brings those ideas into deployment and operations, and Building on Quicksand closes with the uncertainty introduced by asynchronous recovery. Read in order, keeping one familiar service in mind. For each resource, write down an assumption your service makes about communication or failure and how you would test it. Curated from collections by Dan Creswell (https://dancres.github.io/Pages/) and Fred Hébert (https://ferd.ca/a-distributed-systems-reading-list.html); commentary and reading order are original.
Curated by JakeUpdated Oct 10, 2026
Start hereWhy Distributed Computing? ↗
Read at your own pace. Save this list to keep track of your progress.
2·www.igvita.com
Latency: The New Web Performance Bottleneck
Why I added thisSeparate bandwidth from round-trip latency before reasoning about remote calls.
3·web.mit.edu
End-to-End Arguments in System Design
Why I added thisExamine which reliability guarantees must be checked by the application itself.
4·www.cidrdb.org
Data on the Outside versus Data on the Inside
Why I added thisStudy how service boundaries change the meaning and lifetime of data.
5·mvdirona.com
On Designing and Deploying Internet-Scale Services
Why I added thisConnect architectural decisions to deployment, automation, recovery, and operational work.
6·arxiv.org
Building on Quicksand
Why I added thisTrace the application consequences of asynchronous replication and uncertain outcomes.
KEEP EXPLORING
More from Jake
7 resources
Advanced Distributed Systems Research Papers
Use this collection after the fundamentals, consensus, and storage paths to explore design choices that cross those boundaries. Gray's economics paper and the data-engineering rules establish a cost-oriented way to reason about placement and caching; their numerical examples are historical, not present-day purchasing advice. The next papers examine ordering throughput and wide-area replication. Eventually consistent counters provide a focused replication problem, followed by Photon and Mesa as larger systems with demanding data-processing requirements. For each resource, identify the bottleneck, the mechanism introduced to address it, and the new constraint that mechanism creates. The sequence works well for a reading group because the papers invite concrete comparisons of assumptions and evaluation methods rather than agreement on one preferred architecture. Curated from collections by Dan Creswell (https://dancres.github.io/Pages/) and Fred Hébert (https://ferd.ca/a-distributed-systems-reading-list.html); commentary and reading order are original.
By Jake
5 resources
Logical Clocks and Ordering in Distributed Systems
Event ordering is a prerequisite for understanding replication conflicts, snapshots, and recovery. Lamport's paper establishes happens-before and explains how logical timestamps can support a total ordering. The dotted version vector examples then make causality concrete in a replicated key-value setting. Interval tree clocks extend the discussion to changing populations of participants, and the global-state survey connects local observations to consistent snapshots. Zab closes the sequence with ordering requirements in a primary-backup service. These resources belong together because they show different uses of ordering rather than presenting timestamps as a universal solution. Draw small executions with concurrent events and delayed messages, and ask what information each mechanism preserves or intentionally discards. Curated from collections by Dan Creswell (https://dancres.github.io/Pages/) and Fred Hébert (https://ferd.ca/a-distributed-systems-reading-list.html); commentary and reading order are original.
By Jake
6 resources
Distributed Transactions and Isolation
Transaction guarantees are easiest to discuss when their scope and observable behavior are explicit. Start with an everyday service interaction that motivates asynchronous work and compensation. The PostgreSQL chapter provides concrete isolation terminology, but it is deliberately identified as historical version documentation. Strong consistency models helps distinguish ordering guarantees from transaction isolation before the HAT paper analyzes which transactional properties can coexist with high availability. Megastore and Spanner then provide two system-level case studies. This sequence suits engineers designing workflows that span records, services, or datacenters. Write a short concurrent execution for every guarantee you intend to require, and separate the atomicity of a business workflow from the semantics of an individual database transaction. Curated from collections by Dan Creswell (https://dancres.github.io/Pages/) and Fred Hébert (https://ferd.ca/a-distributed-systems-reading-list.html); commentary and reading order are original.
By Jake
ReadingTrackA little more read. A little more remembered.