Abstract
This lecture showed how processors communicating through a shared memory, with only read and write operations possible, could solve sophisticated coordination problems such as implementing a distributed counter and taking an atomic global state. Through these examples, the lecture illustrated the fundamental concepts of distributed algorithms, and in particular the notions of atomicity and no waiting.
Here are the main topics covered during this second lecture :
- " Implementing a weak counter " ;
- " Global state of a distributed system " ;
- " Example of a proof of atomicity
