Generalized Agreement Between Concurrent Fail-Stop Processes

For a system of concurrent processes that can fail by stopping, we study a generalization of the traditional binary agreement problem having more than two possible inputs. We provide bounds on the number of possible inputs for which agreement is possible in a system of n concurrent processes that communicate via a shared memory of m cells of sizes gamma sub 1, ...., gamma sub m.