Brief announcement

摘要

In the k-set agreement task, n processes propose values, and have to decide on at most k of these values. In particular, consensus is 1-set agreement. In PODC 2008 Zielinski showed that the anti-Ω failure detector is necessary and sufficient to solve (n ? 1)-set agreement in an asynchronous read/write shared memory system where at most n ? 1 processes can fail by crashing.