Wait-free k-set agreement is impossible: the topology of public knowledge


In the classical consensus problem, each of n processors receives a private input value and produces a decision value, which is one of the original input values, and it is the szune for all processors. This problem is unsolvable deterministically in several standard models, including the asynchronous shared-memory model. The k-set agreement problem is a… (More)
DOI: 10.1145/167088.167122


2 Figures and Tables