Overview
Syllabus
Distributed Computing through Combinatorial Topology
One Communication Round
Reliable Communication?
Muddy Children
Operational Explanation
Informal Task Definition
They Communicate
Colorless Tasks
Shared Read-Write Memory
Asynchronous Failures
Configurations
Executions
Crashes are implicit
Example: Binary Consensus
Colorless Layered Protocol
Input Complex for Binary Consensus
Carrier Map for Consensus
Task Specification
Round Zero Protocol Complex
Single Input: Round One
Protocol Complex: Round One
Protocol Complex Evolution
Lower Bound Strategy
Consensus Example
Barycentric Subdivision
Compositions
Fundamental Theorem
Proof Outline
Taught by
Hausdorff Center for Mathematics