[DistrSys] - Ch6 - Coordination

Distributed Systems - Coordination

* Introduction (reference: 298, time: 0:00)
* Clock synchronization (reference: 299, time: 2:34)
- Physical clocks (slide: 2, reference: 300, time: 7:50)
- Clock synchronization algorithms (slide: 3, reference: 303, time: 13:23)
- Network Time Protocol (slide: 5, reference: 305, time: 20:40)
- The Berkeley alogrithm (slide: 6, reference: 307, time: 27:33)
* Logical clocks (slide: 7, reference: 311, time: 30:29)
- Lamport's logical clocks (slide: 7, reference: 311, time: 31:07)
- Vector clocks (slide: 14, reference: 317, time: 53:05)
* Mutual exclusion (slide: 19, reference: 322, time: 1:06:16)
- Overview (slide: 19, reference: 323, time: 1:06:47)
- A centralized algorithm (slide: 20, reference: 323, time: 1:07:58)
- A distributed algorithm [Ricart & Agrawala] (slide: 21, reference: 324, time: 1:12:06)
- A token-ring algorithm (slide: 22, reference: 326, time: 1:21:20)
- A decentralized algorithm (slide: 23, reference: 327, time: 1:25:19)
* Election algorithms (slide: 27, reference: 330, time: 1:35:15)
- The bully algorithm (slide: 29, reference: 331, time: 1:36:44)
- A ring algorithm (slide: 31, reference: 333, time: 1:42:22)
- Elections in wireless environments (slide: 33, reference: 334, time: 1:46:24)

---

* Reference: Distributed Systems - Third edition - version 3.03 (2020) - Maarten van Steen - Andrew S. Tanenbaum

ANNOTATION BY: an SSP CCE 2021 alumnus who prefered to be anonymous!