Distributed Systems Roadmap

A distributed system is a collection of independent computers that appear to users as a single coherent system. Building software that runs across multiple machines—where failures are inevitable, network delays are unpredictable, and consistency is hard to achieve—requires a completely different mental model than single-machine programming. This roadmap takes you deep into the theory and practice of distributed computing, from the fundamental constraints described by the CAP theorem to the consensus algorithms that underpin systems like etcd, ZooKeeper, and distributed databases.

You’ll learn why distributed systems fail, how to reason about consistency and availability trade-offs, how to build fault-tolerant protocols, and how consensus algorithms work under the hood. This knowledge separates engineers who can design systems that scale reliably from those who build systems that work until they don’t.

Before You Start

• Proficiency in at least one programming language
• Understanding of networking fundamentals (TCP/IP, HTTP)
• Familiarity with basic data structures and algorithms
• Knowledge of operating system concepts (processes, threads, memory)
• Completed System Design fundamentals

The Roadmap

Resources

Books

• Understanding Distributed Systems by Roberto Vitillo
• Designing Data-Intensive Applications by Martin Kleppmann
• Introduction to Reliable and Secure Distributed Systems by Christian Cachin

Papers

• Paxos Made Simple by Leslie Lamport
• In Search of an Understandable Consensus Algorithm
• The Google File System
• Dynamo: Amazon’s Highly Available Key-value Store

Reference Systems

• etcd Documentation
• Apache ZooKeeper Documentation
• Apache Kafka Documentation