Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
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
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Algorithms adapting to point contention
Journal of the ACM (JACM)
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Theoretical Computer Science
Adapting to point contention with long-lived safe agreement
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Can memory be used adaptively by uniform algorithms?
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A closer look at fault tolerance
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We present a long-lived renaming algorithm in the read/write shared memory model. Our algorithm is adaptive to the point contention k and works with bounded memory and bounded values. We consider the renaming problem where each process obtains the new name in the range 1, ...,k(2k-1). In this paper, we present an algorithm with O(k2) step complexity and O(n2N) space complexity, where n and N are an upper bound of k and the number of processes, respectively. The previous best result under the same problem setting is the algorithm with O(k3) step complexity and O(n3N) space complexity presented by Afek et. al[1]. They also presented the algorithm with O(k2 logk) step complexity and O(n3N) space complexity under the condition where unbounded values are allowed. That is, we improve the above two algorithms.