#### DMCA

## The Complexity of Renaming

### Cached

### Download Links

Citations: | 15 - 10 self |

### Citations

849 | Wait-free synchronization
- Herlihy
- 1991
(Show Context)
Citation Context ...domized renaming algorithms 1Shared Object Lower Bound Type Matching Algorithms New Result Deterministic c-loose Renaming Ω(k) Ω(k) Ω(k) Local Local Local [8, 29, 30] [3, 29] Universal Constructions =-=[1, 22]-=- Yes Improves on [18] Improves on [18] Ω(k log(k/c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on [9] Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes R... |

238 |
An O(n log n) sorting network
- Ajtai, Komlos, et al.
- 1983
(Show Context)
Citation Context ...ive renaming algorithm that renames into a namespace of size sub-exponential in k. The technique establishes a reduction between renaming and mutual exclusion using optimal-depth AKS sorting networks =-=[2]-=- as an intermediate step. The Strategy. The proof is based on two steps, outlined in Figure 2. The first step, contained in Claim 1, starts from a wait-free algorithm R, that renames adaptively into a... |

151 | The topological structure of asynchronous computability
- Herlihy, Shavit
- 1999
(Show Context)
Citation Context ...evoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7, 12, 13, 29, 30] or using randomization [3, 5, 16, 31]. Herlihy and Shavit =-=[23]-=-, as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, waitfree renaming is impossible in less than (2k − 1) names, where k is the number of p... |

112 |
Renaming in an asynchronous environment
- Attiya, Bar-Noy, et al.
- 1990
(Show Context)
Citation Context ...tworks, unique names are available, but come from a very large namespace, which reduces their usefulness. Thus, the problem of assigning small unique names to a set of participants, known as renaming =-=[7]-=-, is fundamental in distributed computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7, 12, 13,... |

83 |
Immediate Atomic Snapshots and Fast Renaming
- Borowsky
- 1993
(Show Context)
Citation Context ...enaming [7], is fundamental in distributed computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. =-=[7, 12, 13, 29, 30]-=- or using randomization [3, 5, 16, 31]. Herlihy and Shavit [23], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, waitfree renaming is imp... |

79 | Wait-free algorithms for fast, long-lived renaming
- Moir, Anderson
- 1995
(Show Context)
Citation Context ...enaming [7], is fundamental in distributed computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. =-=[7, 12, 13, 29, 30]-=- or using randomization [3, 5, 16, 31]. Herlihy and Shavit [23], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, waitfree renaming is imp... |

59 |
The art of computer programming, volume 3: (2nd ed.) sorting and searching
- Knuth
- 1998
(Show Context)
Citation Context ...nd with the same asymptotic complexity, but better constants, using a different technique. The same construction can be used starting from constuctible sorting networks, e.g. bitonic sorting networks =-=[27]-=-, at the cost of increased complexity. 4 The Total Step Complexity Lower Bound In this section, we present lower bounds on the total step complexity of randomized renaming and counting. We start from ... |

56 |
Wait-free made fast
- Afek, Dauber, et al.
- 1995
(Show Context)
Citation Context ...domized renaming algorithms 1Shared Object Lower Bound Type Matching Algorithms New Result Deterministic c-loose Renaming Ω(k) Ω(k) Ω(k) Local Local Local [8, 29, 30] [3, 29] Universal Constructions =-=[1, 22]-=- Yes Improves on [18] Improves on [18] Ω(k log(k/c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on [9] Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes R... |

54 | A fast, scalable mutual exclusion algorithm
- Yang, Anderson
- 1994
(Show Context)
Citation Context ...f the above algorithm is the same as the depth of the AKS sorting network (plus one RMR), i.e. O(log n), therefore the algorithm is optimal by the lower bound of Attiya et al. [10]. Anderson and Yang =-=[32]-=- presented an upper bound with the same asymptotic complexity, but better constants, using a different technique. The same construction can be used starting from constuctible sorting networks, e.g. bi... |

43 |
Time and space lower bounds for nonblocking implementations
- Jayanti, Tan, et al.
(Show Context)
Citation Context ...riction.) As we pointed out, our local lower bound applies to counters, fetch-and-increment, queues, and stacks, and extends previous results obtained on these objects. Indeed, Jayanti, Tan and Toueg =-=[25]-=-, as well as Ellen et al. [18], already presented linear lower bounds for deterministic counters, queues and stacks. One limitation of these two results is that the worst-case executions they build re... |

31 | Adaptive wait-free algorithms for lattice agreement and renaming - Attiya, Fouren - 1998 |

27 | Adaptive and efficient algorithms for lattice agreement and renaming
- Attiya, Fouren
(Show Context)
Citation Context ... size of the allowed namespace. Contribution. In this paper, we study the complexity of renaming in a namespace whose size depends on the number of participants (this is also called adaptive renaming =-=[8]-=-). Our study covers both randomized and deterministic algorithms, and also implies lower bounds for other shared objects such as counters, stacks, and queues. Individual Lower Bound. We present a lowe... |

24 | A time complexity bound for adaptive mutual exclusion
- Kim, Anderson
(Show Context)
Citation Context ...he transformation ensures that, if the algorithm R renames in a sub-exponential namespace with step complexity o(k), the resulting mutual exclusion algorithm uses o(k) remote memory references (RMRs) =-=[10, 26]-=- to enter and exit the critical section. However, the existence of such an algorithm contradicts a linear lower bound of Anderson and Kim [26] on the RMR complexity of mutual exclusion, concluding the... |

22 | Tight RMR lower bounds for mutual exclusion and other problems
- Attiya, Hendler, et al.
- 2008
(Show Context)
Citation Context ...he transformation ensures that, if the algorithm R renames in a sub-exponential namespace with step complexity o(k), the resulting mutual exclusion algorithm uses o(k) remote memory references (RMRs) =-=[10, 26]-=- to enter and exit the critical section. However, the existence of such an algorithm contradicts a linear lower bound of Anderson and Kim [26] on the RMR complexity of mutual exclusion, concluding the... |

22 | A time complexity lower bound for randomized implementations of some shared objects
- Jayanti
- 1998
(Show Context)
Citation Context ... 1 By individual step complexity we mean the number of per-process shared memory operations, not the number of local computation steps. 2technique improves on previous lower bounds for these objects =-=[9, 10, 24]-=-, since it covers the global complexity of randomized approximate solutions. Our global results are tight within logarithmic factors for counters [6] and fetchand-increment registers [3]. In the case ... |

21 | Randomized naming using wait-free shared variables
- Panconesi, Papatriantafilou, et al.
- 1998
(Show Context)
Citation Context ...computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7, 12, 13, 29, 30] or using randomization =-=[3, 5, 16, 31]-=-. Herlihy and Shavit [23], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, waitfree renaming is impossible in less than (2k − 1) names, w... |

20 | Linear lower bounds on real-world implementations of concurrent objects
- Fich, Hendler, et al.
- 2005
(Show Context)
Citation Context ...ct Lower Bound Type Matching Algorithms New Result Deterministic c-loose Renaming Ω(k) Ω(k) Ω(k) Individual Individual Individual [8], [27], [28] [3], [27] Universal Constructions [1] Yes Improves on =-=[18]-=- Improves on [18] Ω(k log(k/c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on [9] Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes Randomized c-approx. C... |

16 | long-lived renaming improved and simplified - Fast - 1998 |

15 | The Las-Vegas Processor Identity Problem (How and When to Be Unique
- Kutten, Ostrovsky, et al.
- 2000
(Show Context)
Citation Context ... allowing a vanishing probability that the algorithm does not terminate). Renaming has been shown to be related to weak symmetry breaking in [19]; it is also related to the processor identity problem =-=[28]-=-; the key difference is that, for renaming, participants are assumed to have distinct initial identifiers (from an unbounded namespace). Several renaming algorithms were proposed in the literature, e.... |

14 | Fast Randomized Test-and-Set and Renaming
- Alistarh, Attiya, et al.
- 2010
(Show Context)
Citation Context ...computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7, 12, 13, 29, 30] or using randomization =-=[3, 5, 16, 31]-=-. Herlihy and Shavit [23], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, waitfree renaming is impossible in less than (2k − 1) names, w... |

13 |
New Combinatorial Topology Upper and Lower Bounds for Renaming
- Castañeda, Rajsbaum
- 2008
(Show Context)
Citation Context ...hat minimize the size of the available namespace, whether deterministically, e.g. [7, 12, 13, 29, 30] or using randomization [3, 5, 16, 31]. Herlihy and Shavit [23], as well as Rajsbaum and Castañeda =-=[14]-=-, showed that, for deterministic algorithms using only reads and writes, waitfree renaming is impossible in less than (2k − 1) names, where k is the number of participants. Algorithms using randomizat... |

13 | Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
- Golab, Hadzilacos, et al.
(Show Context)
Citation Context ...work with n input (and output) ports, and a vector Done of boolean bits, initially false. We replace each comparator in the network with a two-process test-and-set object with constant RMR complexity =-=[20,21]-=-. In the mutual exclusion problem processes hold unique initial identifiers from 1 to n, therefore we use these initial identifiers to assign unique input ports to processes. A process progresses thro... |

12 | Fully-adaptive algorithms for long-lived renaming
- Brodsky, Ellen, et al.
(Show Context)
Citation Context ..., is fundamental in distributed computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7], [12], =-=[13]-=-, [27], [28] or using randomization [3], [5], [16], [29]. Herlihy and Shavit [21], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, wait-f... |

12 | long-lived renaming improved and simplified - Moir, Fast - 1998 |

11 |
waitfree renaming with optimal name space and high throughput
- Long-lived
- 1998
(Show Context)
Citation Context ...computing. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7, 12, 13, 29, 30] or using randomization =-=[3, 5, 16, 31]-=-. Herlihy and Shavit [23], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, waitfree renaming is impossible in less than (2k − 1) names, w... |

10 | Time and space lower bounds for implementations using -cas
- Attiya, Hendler
- 2005
(Show Context)
Citation Context ...(k) Ω(k) Local Local Local [8, 29, 30] [3, 29] Universal Constructions [1, 22] Yes Improves on [18] Improves on [18] Ω(k log(k/c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on =-=[9]-=- Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes Randomized c-approx. Counter Ω(k log(k/c)) Global [6] Yes Fetch-and-Increment Ω(k) Ω(k) Local Local [3, 29] Universal Construc... |

10 | The Extended BG simulation and the characterization of t-resiliency
- Gafni
- 2009
(Show Context)
Citation Context ...s [29], as well as using randomization [16] (at the cost of allowing a vanishing probability that the algorithm does not terminate). Renaming has been shown to be related to weak symmetry breaking in =-=[19]-=-; it is also related to the processor identity problem [28]; the key difference is that, for renaming, participants are assumed to have distinct initial identifiers (from an unbounded namespace). Seve... |

9 | An O(1) rmrs leader election algorithm
- Golab, Hendler, et al.
(Show Context)
Citation Context ...work with n input (and output) ports, and a vector Done of boolean bits, initially false. We replace each comparator in the network with a two-process test-and-set object with constant RMR complexity =-=[20,21]-=-. In the mutual exclusion problem processes hold unique initial identifiers from 1 to n, therefore we use these initial identifiers to assign unique input ports to processes. A process progresses thro... |

8 |
János Komlós, and Endre Szemerédi. An o(n log n) sorting network
- Ajtai
- 1983
(Show Context)
Citation Context ...ive renaming algorithm that renames into a namespace of size sub-exponential in k. The technique establishes a reduction between renaming and mutual exclusion using optimal-depth AKS sorting networks =-=[2]-=- as an intermediate step. The Strategy. The proof is based on two steps, outlined in Figure 2. The first step, contained in Claim 1, starts from a wait-free algorithm R, renaming adaptively into a loo... |

8 |
Morteza Zadimoghaddam. Optimal-time adaptive strong renaming, with applications to counting
- Alistarh, Aspnes, et al.
- 2011
(Show Context)
Citation Context |

8 | An Ω(n log n) lower bound on the cost of mutual exclusion
- Fan, Lynch
- 2006
(Show Context)
Citation Context ... global lower bound is the first to cover randomized and 12approximate implementations and in this sense generalizes the deterministic lower bounds of Attiya et al. [9, 10] and that of Fan and Lynch =-=[17]-=- for the state-change model, when applied to these objects. 7 Summary and Future Work We prove tight bounds for assigning unique names using a shared memory. We cover the local and global cost of adap... |

7 | Asynchronous exclusive selection
- Chlebus, Kowalski
- 2008
(Show Context)
Citation Context ...he key difference is that, for renaming, participants are assumed to have distinct initial identifiers (from an unbounded namespace). Several renaming algorithms were proposed in the literature, e.g. =-=[3, 5, 7, 8, 12, 15, 29, 30]-=-. The randomized renaming algorithm of [3] is time-optimal, as per our global lower bound. On the other hand, our local lower bound is matched by the algorithm of [29] which assumes hardware test-and-... |

7 | Optimal-time adaptive strong renaming, with applications to counting
- Alistarh, Aspnes, et al.
- 2011
(Show Context)
Citation Context ...g. A lot of work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7], [12], [13], [27], [28] or using randomization =-=[3]-=-, [5], [16], [29]. Herlihy and Shavit [21], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, wait-free renaming is impossible in less than... |

5 |
registers, counters, and monotone circuits
- Max
- 2009
(Show Context)
Citation Context ...c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on [9] Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes Randomized c-approx. Counter Ω(k log(k/c)) Global =-=[6]-=- Yes Fetch-and-Increment Ω(k) Ω(k) Local Local [3, 29] Universal Constructions [1, 22] Improves on [18] Improves on [18] Ω(k log k) Ω(k log k) Global Global [3] - Improves on [9] Improves on [9] Queue... |

4 |
waitfree renaming with optimal name space and high throughput
- Eberly, Higham, et al.
- 1998
(Show Context)
Citation Context ...f work has been devoted to devising renaming algorithms that minimize the size of the available namespace, whether deterministically, e.g. [7], [12], [13], [27], [28] or using randomization [3], [5], =-=[16]-=-, [29]. Herlihy and Shavit [21], as well as Rajsbaum and Castañeda [14], showed that, for deterministic algorithms using only reads and writes, wait-free renaming is impossible in less than (2k − 1) n... |

3 |
Mutual exclusion with O(log log n) amortized work
- Bender, Gilbert
- 2011
(Show Context)
Citation Context ...ds for counters, queues, and stacks. One way to circumvent our lower bounds would be to assume a weaker adversary, or to allow some probability of error for the algorithms. In particular, it is known =-=[11]-=- that approximate counting can be achieved with O(log log n) expected steps against an oblivious adversary, that fixes the schedule in advance. Our results reveal the first connection between renaming... |

3 | registers, counters, and monotone circuits
- Aspnes, Attiya, et al.
(Show Context)
Citation Context ...c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on [9] Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes Randomized c-approx. Counter Ω(k log(k/c)) Global =-=[6]-=- Yes Fetch-and-Increment Ω(k) Ω(k) Individual Individual [3], [27] Universal Constructions [1] Improves on [18] Improves on [18] Ω(k log k) Ω(k log k) Global Global [3] - Improves on [9] Improves on [... |

3 | Herlihy and Nir Shavit. The topological structure of asynchronous computability - Maurice - 1999 |

2 |
Nir Shavit. Linear lower bounds on real-world implementations of concurrent objects
- Fich, Hendler
- 2005
(Show Context)
Citation Context ...hms 1Shared Object Lower Bound Type Matching Algorithms New Result Deterministic c-loose Renaming Ω(k) Ω(k) Ω(k) Local Local Local [8, 29, 30] [3, 29] Universal Constructions [1, 22] Yes Improves on =-=[18]-=- Improves on [18] Ω(k log(k/c)) Ω(k log k) Ω(k log k) Global Global Global [3] [3] - Yes Improves on [9] Improves on [9] Randomized c-loose Renaming Ω(k log(k/c)) Global [3] Yes Randomized c-approx. C... |

2 | Borowsky and Eli Gafni. Immediate atomic snapshots and fast renaming - Elizabeth - 1993 |

1 |
The Complexity of Renaming,” EPFL
- Alistarh, Aspnes, et al.
- 2011
(Show Context)
Citation Context ...n overview of related work, while Section 7 summarizes our results. Due to space limitations, we present proof sketches for some claims; complete proofs can be found in the full version of this paper =-=[4]-=-.2. PRELIMINARIES Assumptions. We consider a standard asynchronous shared memory model with n processes, t < n of which may fail by crashing. Processes that do not crash during the execution are call... |

1 | Aspnes, Hagit Attiya, and Keren Censor. Max registers, counters, and monotone circuits - James - 2009 |