Introduction
Message Passing
- Model
- Broadcast and Convergecast
- Distributed Breadth-First Search
- Leader Election
- Logical Clocks
- Synchronizers
- Coordinated Attack
- Synchronous Agreement
- Byzantine Agreement
- Impossibility of Asynchronous Agreement
- Paxos
- Failure Detectors
- Quorum Systems
Shared Memory
- Model
- Distributed Shared Memory
- Mutual Exclusion
- The Wait-Free Hierarchy
- Atomic Snapshots
- Lower Bounds on Perturbable Objects
- Restricted-Use Objects
- Common2
- Randomized Consensus and Test-and-Set
- Renaming
- Software Transactional Memory
- Obstruction-Freedom
- BG Simulation
- Topological Methods
- Approximate Agreement
Other Communication Models
- Overview
- Self-stabilization
- Population Protocols and Chemical Reaction Networks
- Mobile Robots
- Beeping
Appendix
- Assignments
- Sample Assignments from Spring 2019
- Sample Assignments from Spring 2016
- Sample Assignments from Spring 2014
- Sample Assignments from Fall 2011
- Additional Sample Final Exams
- I/O Automata
CPSC 465: Theory of Distributed Systems.
James Aspnes.
www.cs.yale.edu .
Oct 7, 2020.