Lecture

Test-and-Set Objects

Description

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.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.