Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Renaming in an asynchronous environment
Journal of the ACM (JACM)
Lower bounds for wait-free computation in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Achieving optimal CRCW PRAM fault-tolerance
Information Processing Letters
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Fast, long-lived renaming improved and simplified
Science of Computer Programming
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Wait-free implementations in message-passing systems
Theoretical Computer Science
The topological structure of asynchronous computability
Journal of the ACM (JACM)
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
SIAM Journal on Computing
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Algorithms adapting to point contention
Journal of the ACM (JACM)
Mathematical Structures in Computer Science
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
The complexity of synchronous iterative Do-All with crashes
Distributed Computing
Long lived adaptive splitter and applications
Distributed Computing
A scalable lock-free stack algorithm
Journal of Parallel and Distributed Computing
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
| Hi-index | 0.00 |
Long-lived renaming allows processes to repeatedly get distinct names from a small name space and release these names. This paper presents two long-lived renaming algorithms in which the name a process gets is bounded above by the number of processes currently occupying a name or performing one of these operations. The first is asynchronous, uses LL/SC objects, and has step complexity that is linear in the number of processes, c, currently getting or releasing a name. The second is synchronous, uses registers and counters, and has step complexity that is polylogarithmic in c. Both tolerate any number of process crashes.