YoVDO

The Asynchronous Computability Theorem - Distributed Systems and Algebraic Topology

Offered By: Churchill CompSci Talks via YouTube

Tags

Distributed Systems Courses Consensus Protocol Courses Algebraic Topology Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the surprising connection between distributed systems protocols and algebraic topology concepts in this 28-minute talk on the Asynchronous Computability Theorem. Delve into a concise mathematical framework that unifies classical concurrency models, enabling reasoning about concurrency through static combinatorial structures. Learn how this connection proves the impossibility of achieving consensus in an asynchronous wait-free model. Gain insights into the mathematical foundations of distributed systems and their limitations as presented by Hei Li at Churchill College, Cambridge on January 19, 2022.

Syllabus

The Asynchronous Computability Theorem


Taught by

Churchill CompSci Talks

Related Courses

Advanced Operating Systems
Georgia Institute of Technology via Udacity High Performance Computing
Georgia Institute of Technology via Udacity GT - Refresher - Advanced OS
Georgia Institute of Technology via Udacity Distributed Machine Learning with Apache Spark
University of California, Berkeley via edX CS125x: Advanced Distributed Machine Learning with Apache Spark
University of California, Berkeley via edX