ACM Transactions on Programming Languages and Systems (TOPLAS)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
From adaptive renaming to set agreement
Theoretical Computer Science
On the implementation of concurrent objects
Dependable and Historic Computing
Hi-index | 0.89 |
This short note shows how a simple extension of object types with consensus number 2 boosts them to an infinite consensus number. This extension is a simple embedding of a shared memory write within the base operation defining the corresponding type with consensus number 2. The style of this note is voluntarily informal.