For an algorithm to safely solve a task, this transformation must respect the connectivity of the space. In mathematical terms, the execution of an error-tolerant protocol acts as a of the input complex. It breaks the original triangles or tetrahedrons into smaller sub-triangles, representing the uncertainty and interleaving of process steps. The Connectivity Invariant
: Published by Maurice Herlihy, Dmitry Kozlov, and Sergio Rajsbaum in 2013, this is the definitive textbook on the subject, bridging the gap between algebraic topology and theoretical computer science. Summary of Applications Application Field How Topology is Applied Wait-Free Computability
This PDF is a of the original textbook. For formal citations: distributed computing through combinatorial topology pdf
Topology provides a unified language to compare different models of computation. By analyzing the geometric structures allowed by message-passing vs. read-write shared memory, researchers can quickly determine if a protocol designed for one paradigm can be ported to another.
Published by Morgan Kaufmann (Elsevier), the 2013 (and subsequent reprints) text is the definitive synthesis of 20 years of research. The authors are legendary: Herlihy (father of transactional memory), Kozlov (a topologist), and Rajsbaum (a pioneer in distributed computing theory). For an algorithm to safely solve a task,
The set of all possible executions of a protocol yields a collection of these simplices. Because these simplices naturally share faces (e.g., if three processes share a global state, any two of them also share a partial state), they glue together to form a .
This section focuses on "colorless" tasks, where only the set of input values matters, not which process holds which value. Chapter 4 explains the core asynchronous wait-free model, where processes operate in a shared memory and any process can fail at any time without warning. It culminates in the . This landmark theorem provides the necessary and sufficient conditions for solving a task in this model, acting as a complete "solvability chart" for colorless distributed problems. Chapter 5 then applies this powerful theorem to analyze fundamental problems like consensus and set agreement, proving classic impossibility results in a unified, topological way. The Connectivity Invariant : Published by Maurice Herlihy,
As processors exchange messages, they gain more information about the overall system state. Mathematically, this acts as a of the input complex.