Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Fast, long-lived renaming improved and simplified
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
A time complexity lower bound for randomized implementations of some shared objects
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
SIAM Journal on Computing
Wait-free Test-and-Set (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Fast, Long-Lived Renaming (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Fast, Long-Lived Renaming Improved and Simplified
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Randomized two-process wait-free test-and-set
Distributed Computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Randomized naming using wait-free shared variables
Distributed Computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
New combinatorial topology upper and lower bounds for renaming
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Tight bounds for asynchronous randomized consensus
Journal of the ACM (JACM)
From adaptive renaming to set agreement
Theoretical Computer Science
Max registers, counters, and monotone circuits
Proceedings of the 28th ACM symposium on Principles of distributed computing
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Lower bounds for restricted-use objects: extended abstract
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Early deciding synchronous renaming in o( logf) rounds or less
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
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
Hi-index | 0.00 |
We give two new randomized algorithms for strong renaming, both of which work against an adaptive adversary in asynchronous shared memory. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of n processes with step complexity O(log3 n). The second transforms any sorting network into a strong adaptive renaming protocol, with an expected cost equal to the depth of the sorting network. Using an AKS sorting network, this gives a strong adaptive renaming algorithm with step complexity O(log k), where k is the contention in the current execution. We show this to be optimal based on a classic lower bound of Jayanti. We also show that any such strong renaming protocol can be used to build a monotone-consistent counter with logarithmic step complexity (at the cost of adding a max register) or a linearizable fetch-and-increment register (at the cost of increasing the step complexity by a logarithmic factor).