Distributed Computing Through Combinatorial Topology Pdf =link= May 2026
That is a classic and foundational text in the field of theoretical distributed computing. You are likely referring to the work by Maurice Herlihy, Dmitry Kozlov, and Sergio Rajsbaum, most formally codified in their book Distributed Computing Through Combinatorial Topology.
The framework translates abstract computing states into physical geometric forms: distributed computing through combinatorial topology pdf
- Searchable cross-referencing (e.g., searching for "simplicial map" or "Round-by-Round").
- Zooming on complex diagrams (the commutative diagrams and geometric visualizations are intricate).
- Digital annotation for proofs.
Static Representation of Dynamic Executions: It models all possible interleavings of process operations and failure scenarios as a single, static combinatorial object called a simplicial complex. That is a classic and foundational text in
5. Worked Examples
- Binary consensus: Showing the protocol complex is connected → output must be connected → impossibility.
- Renaming: Using the Sperner lemma / non-looping argument.
- ( k )-set agreement: Requires the protocol complex to be ( (k-1) )-connected (not possible for certain parameters).
In the late 1980s and early 90s, computer scientists Maurice Herlihy, Sergio Rajsbaum, and others asked a bold question: What if we stopped looking at the steps and started looking at the space of all possible outcomes? Searchable cross-referencing (e
- Simplicial Complex: A simplicial complex is a collection of simplices glued together in a specific way. In the context of distributed computing, a simplicial complex represents the communication network of a distributed system.
- Nerve of a Covering: The nerve of a covering is a simplicial complex that encodes the intersection pattern of a collection of sets. In distributed computing, the nerve of a covering can be used to represent the communication pattern between nodes.
- Homology: Homology is a fundamental concept in algebraic topology that studies the holes in a topological space. In distributed computing, homology can be used to detect concurrency bugs or to verify the correctness of a distributed protocol.
