Renaming in an asynchronous environment
Journal of the ACM (JACM)
Agreement is harder than consensus: set consensus problems in totally asynchronous systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Generalized FLP impossibility result for t-resilient asynchronous computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
The asynchronous computability theorem for t-resilient tasks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Sharing memory robustly in message-passing systems
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
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
The Combinatorial Structure of Wait-Free Solvable Tasks
SIAM Journal on Computing
Mathematical Structures in Computer Science
A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes
SIAM Journal on Computing
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
Subconsensus tasks: renaming is weaker than set agreement
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Counting-based impossibility proofs for renaming and set agreement
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Upper bound on the complexity of solving hard renaming
Proceedings of the 2013 ACM symposium on Principles of distributed computing
ACM SIGACT News
Hi-index | 0.00 |
In the renaming task, n+1 processes start with unique input names from a large space and must choose unique output names taken from a smaller name space, 0,1,…, K. To rule out trivial solutions, a protocol must be anonymous: the value chosen by a process can depend on its input name and on the execution, but not on the specific process ID. Attiya et al. [1990] showed that renaming has a wait-free solution when K≥ 2n. Several algebraic topology proofs of a lower bound stating that no such protocol exists when K n have been published. In a companion article, we present the first completely combinatorial renaming lower bound proof stating if n + 1 is a primer power, then renaming is not wait-free solvable when K n. In this article, we show that if n + 1 is not a primer power, then there exists a wait-free renaming protocol for K = 2n−1. Therefore the renaming lower bound for K n is incorrect. More precisely, our main theorem states that there exists a wait-free renaming protocol for K n if and only if n + 1 is not a prime power. We prove this result using the known equivalence of K-renaming for K = 2n − 1 and the weak symmetry breaking task: processes have no input values and the output values are 0 or 1, and it is required that in every execution in which all processes participate, at least one process decides 1 and at least one process decides 0.