Distributed Computing through Combinatorial Topology

Distributed Computing through Combinatorial Topology

Hausdorff Center for Mathematics via YouTube Direct link

Protocol Complex Evolution

22 of 28

22 of 28

Protocol Complex Evolution

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. 1 Distributed Computing through Combinatorial Topology
  2. 2 One Communication Round
  3. 3 Reliable Communication?
  4. 4 Muddy Children
  5. 5 Operational Explanation
  6. 6 Informal Task Definition
  7. 7 They Communicate
  8. 8 Colorless Tasks
  9. 9 Shared Read-Write Memory
  10. 10 Asynchronous Failures
  11. 11 Configurations
  12. 12 Executions
  13. 13 Crashes are implicit
  14. 14 Example: Binary Consensus
  15. 15 Colorless Layered Protocol
  16. 16 Input Complex for Binary Consensus
  17. 17 Carrier Map for Consensus
  18. 18 Task Specification
  19. 19 Round Zero Protocol Complex
  20. 20 Single Input: Round One
  21. 21 Protocol Complex: Round One
  22. 22 Protocol Complex Evolution
  23. 23 Lower Bound Strategy
  24. 24 Consensus Example
  25. 25 Barycentric Subdivision
  26. 26 Compositions
  27. 27 Fundamental Theorem
  28. 28 Proof Outline

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.