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 limitations of binary registers and test-and-set objects in achieving consensus among processes. It explains the critical states and bivalent states in consensus algorithms, highlighting the impossibility of achieving consensus for three processes using test-and-set objects.