Renaming in an asynchronous environment
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Set consensus using arbitrary objects (preliminary version)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
SIAM Journal on Computing
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability
SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The 0---1-Exclusion Families of Tasks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
From adaptive renaming to set agreement
Theoretical Computer Science
N-consensus is the second strongest object for N + 1 processes
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
The universe of symmetry breaking tasks
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Renaming with k-set-consensus: an optimal algorithm into n + k - 1 slots
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
The renaming problem in shared memory systems: An introduction
Computer Science Review
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
In the wait-free shared memory model substantial attention has been devoted to understanding the relative power of sub-consensus tasks. Two important sub-consensus families of tasks have been identified: k-set agreement and M-renaming. When 2≤k≤n−1 and n≤M≤2n−2, these tasks are more powerful than read/write registers, but not strong enough to solve consensus for two processes. This paper studies the power of renaming with respect to set agreement. It shows that, in a system of n processes, n-renaming is strictly stronger than (n−1)-set agreement, but not stronger than (n−2)-set agreement. Furthermore, (n+1)-renaming cannot solve even (n−1)-set agreement. As a consequence, there are cases where set agreement and renaming are incomparable when looking at their power to implement each other.