Lecture
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
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.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace