The Life in 1-Consensus
Yehuda Afek, Eli Daian, Eli Gafni

TL;DR
This paper introduces a new deterministic shared memory object, $ ext{WRN}_{k}$, that surpasses read-write registers in strength but cannot implement 2-processor consensus, challenging existing conjectures about consensus number 1 objects.
Contribution
It presents the $ ext{WRN}_{k}$ object, demonstrating that objects with consensus number 1 can be strictly stronger than read-write registers, refuting prior conjectures.
Findings
$ ext{WRN}_{k}$ is stronger than read-write registers for $k extgreater 2$.
$ ext{WRN}_{k}$ cannot implement 2-processor consensus.
Refutes the conjecture that all consensus number 1 objects are equivalent to read-write registers.
Abstract
This paper introduces the atomic Write and Read Next () deterministic shared memory object, that for any , is stronger than read-write registers, but is unable to implement -processor consensus. In particular, it refutes the conjecture claiming that every deterministic object of consensus number is computationally equivalent to read-write registers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Interconnection Networks and Systems · Parallel Computing and Optimization Techniques
