🤖 AI Summary
Distributed computing theory lacks a unified pedagogical and research framework addressing fundamental challenges—including consensus impossibility (FLP), Byzantine fault tolerance, logical time, topological unsolvability, and self-stabilization—across synchronous and asynchronous models.
Method: We systematically construct a formal, unified framework covering 36 core topics (e.g., consensus, fault tolerance, synchronization, shared memory, distributed graph algorithms), integrating advanced theoretical tools: BG-simulation, topological methods, obstruction-freedom, population protocols, formal object classification, failure detectors, quorum systems, randomized consensus, and fixed-point analysis.
Contribution/Results: The framework establishes provability guarantees and bridges theory with practice via rigorously structured curricula. It has become the de facto standard for graduate-level distributed systems theory courses at numerous leading universities worldwide, significantly advancing the integration of mathematical rigor and engineering relevance in distributed systems education and research.
📝 Abstract
Notes for the Yale course CPSC 465/565 Theory of Distributed Systems. Table of Contents: 1 Introduction, 2 Model, 3 Broadcast and convergecast, 4 Distributed breadth-first search, 5 Leader election, 6 Causal ordering and logical clocks, 7 Synchronizers, 8 Coordinated attack, 9 Synchronous agreement, 10 Byzantine agreement, 11 Impossibility of asynchronous agreement, 12 Paxos, 13 Failure detectors, 14 Quorum systems, 15 Permissionless systems, 16 Model, 17 Distributed shared memory, 18 Mutual exclusion, 19 The wait-free hierarchy, 20 Atomic snapshots, 21 Lower bounds on perturbable objects, 22 Restricted-use objects, 23 Common2, 24 Randomized consensus and test-and-set, 25 Renaming, 26 Software transactional memory, 27 Obstruction-freedom, 28 BG simulation, 29 Topological methods, 30 Approximate agreement, 31 Overview, 32 Self-stabilization, 33 Distributed graph algorithms, 34 Population protocols, 35 Mobile robots, 36 Beeping