Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the concept of anonymous concurrent computing, focusing on counters, weak counters, snapshots, and consensus algorithms. It explains sequential, atomic, lock-free, and wait-free implementations, highlighting key ideas for atomicity and wait-freedom.