Completed
Executions
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Distributed Computing through Combinatorial Topology
Automatically move to the next video in the Classroom when playback concludes
- 1 Distributed Computing through Combinatorial Topology
- 2 One Communication Round
- 3 Reliable Communication?
- 4 Muddy Children
- 5 Operational Explanation
- 6 Informal Task Definition
- 7 They Communicate
- 8 Colorless Tasks
- 9 Shared Read-Write Memory
- 10 Asynchronous Failures
- 11 Configurations
- 12 Executions
- 13 Crashes are implicit
- 14 Example: Binary Consensus
- 15 Colorless Layered Protocol
- 16 Input Complex for Binary Consensus
- 17 Carrier Map for Consensus
- 18 Task Specification
- 19 Round Zero Protocol Complex
- 20 Single Input: Round One
- 21 Protocol Complex: Round One
- 22 Protocol Complex Evolution
- 23 Lower Bound Strategy
- 24 Consensus Example
- 25 Barycentric Subdivision
- 26 Compositions
- 27 Fundamental Theorem
- 28 Proof Outline
