N-Consensus is the Second Strongest Object for N+1 Processes

@inproceedings{Gafni2007NConsensusIT,
  title={N-Consensus is the Second Strongest Object for N+1 Processes},
  author={Eli Gafni and Petr Kuznetsov},
  booktitle={OPODIS},
  year={2007}
}
Objects like queue, swap, and test-and-set allow two processes to reach consensus, and are consequently “universal” for a system of two processes. But are there deterministic objects that do not solve 2-process consensus, and nevertheless allow two processes to solve a task that is not otherwise wait-free solvable in read-write shared memory? The answer “no” is a simple corollary of the main result of this paper: Let A be a deterministic object such that no protocol solves consensus among n + 1… CONTINUE READING
3 Citations
12 References
Similar Papers

Similar Papers

Loading similar papers…