Problems Solvable in Asynchronous Systems
Hagit Attiya, Jennifer Lundelius Welch · Distributed Computing · 2004
This chapter surveys several problems that can be solved in asynchronous systems in which processors communicate through shared read/write objects and are subject to crash failures. The specific problems considered are set consensus, approximate agreement, renaming, and k-exclusion. A lower bound is shown for set consensus relating the number of failures that can be tolerated and the allowed maximum size of the set of decision values.