A Reading List of the Papers That Built Modern Distributed Systems

Nicolae Vartolomei’s curated bibliography gathers ten foundational papers that define how engineers reason about coordination across unreliable machines. The lineup leans heavily on Leslie Lamport, whose work on logical clocks and event ordering (1978), the Byzantine Generals Problem (1982, with Shostak and Pease), distributed snapshots (1985, with Chandy), and Paxos — first as ‘The Part-Time Parliament’ (1998) and later the plainer ‘Paxos Made Simple’ (2001) — supplies much of the theoretical backbone for consensus and fault tolerance still in use today.

The list balances impossibility results and practical protocols. Fischer, Lynch, and Paterson’s 1985 FLP proof establishes that no deterministic consensus is guaranteed when even a single process can fail, setting hard limits that later systems work around. Oki and Liskov’s Viewstamped Replication (1988) and Ongaro and Ousterhout’s Raft (2014) offer more approachable routes to the same goal, with Raft explicitly designed to be easier to understand than Paxos. CRDTs (Shapiro et al., 2011) address conflict-free merging for eventually consistent data, and Nakamoto’s 2008 Bitcoin paper extends Byzantine agreement to an open, permissionless setting.

The significance is less any single entry than the through-line: the same problems — ordering, agreement, replication, and failure — recur across four decades of research, and these papers remain the shortest path to understanding the trade-offs behind today’s databases, blockchains, and cloud infrastructure. It reads as a starting syllabus rather than a survey.