Matches in SemOpenAlex for { <https://semopenalex.org/work/W2057041531> ?p ?o ?g. }
- W2057041531 endingPage "51" @default.
- W2057041531 startingPage "1" @default.
- W2057041531 abstract "This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual lower bound of Ω( k ) process steps for deterministic renaming into any namespace of size subexponential in k , where k is the number of participants. The bound is tight: it draws an exponential separation between deterministic and randomized solutions, and implies new tight bounds for deterministic concurrent fetch-and-increment counters, queues, and stacks. The proof is based on a new reduction from renaming to another fundamental problem in distributed computing: mutual exclusion. We complement this individual bound with a global lower bound of Ω( k log ( k / c )) on the total step complexity of renaming into a namespace of size ck , for any c ≥ 1. This result applies to randomized algorithms against a strong adversary, and helps derive new global lower bounds for randomized approximate counter implementations, that are tight within logarithmic factors. On the algorithmic side, we give a protocol that transforms any sorting network into a randomized strong adaptive renaming algorithm, with expected cost equal to the depth of the sorting network. This gives a tight adaptive renaming algorithm with expected step complexity O (log k ), where k is the contention in the current execution. This algorithm is the first to achieve sublinear time, and it is time-optimal as per our randomized lower bound. Finally, we use this renaming protocol to build monotone-consistent counters with logarithmic step complexity and linearizable fetch-and-increment registers with polylogarithmic cost." @default.
- W2057041531 created "2016-06-24" @default.
- W2057041531 creator A5036421091 @default.
- W2057041531 creator A5042520814 @default.
- W2057041531 creator A5049321288 @default.
- W2057041531 creator A5061279024 @default.
- W2057041531 creator A5083822059 @default.
- W2057041531 date "2014-05-01" @default.
- W2057041531 modified "2023-10-18" @default.
- W2057041531 title "Tight Bounds for Asynchronous Renaming" @default.
- W2057041531 cites W1551716502 @default.
- W2057041531 cites W1672483193 @default.
- W2057041531 cites W1896834640 @default.
- W2057041531 cites W1964746194 @default.
- W2057041531 cites W1966074520 @default.
- W2057041531 cites W1977697792 @default.
- W2057041531 cites W1982100000 @default.
- W2057041531 cites W1987782288 @default.
- W2057041531 cites W1992427547 @default.
- W2057041531 cites W1993805917 @default.
- W2057041531 cites W1997124359 @default.
- W2057041531 cites W1998458999 @default.
- W2057041531 cites W1999197902 @default.
- W2057041531 cites W2006656863 @default.
- W2057041531 cites W2021785007 @default.
- W2057041531 cites W2023866984 @default.
- W2057041531 cites W2024581561 @default.
- W2057041531 cites W2030003887 @default.
- W2057041531 cites W2030205622 @default.
- W2057041531 cites W2030785908 @default.
- W2057041531 cites W2031502627 @default.
- W2057041531 cites W2034325394 @default.
- W2057041531 cites W2039113664 @default.
- W2057041531 cites W2039966494 @default.
- W2057041531 cites W2041549661 @default.
- W2057041531 cites W2047846644 @default.
- W2057041531 cites W2052556176 @default.
- W2057041531 cites W2054439685 @default.
- W2057041531 cites W2054987727 @default.
- W2057041531 cites W2070570981 @default.
- W2057041531 cites W2070595838 @default.
- W2057041531 cites W2070832726 @default.
- W2057041531 cites W2070993796 @default.
- W2057041531 cites W2076458424 @default.
- W2057041531 cites W2077437089 @default.
- W2057041531 cites W2079376185 @default.
- W2057041531 cites W2085407655 @default.
- W2057041531 cites W2095126777 @default.
- W2057041531 cites W2101939036 @default.
- W2057041531 cites W2107149336 @default.
- W2057041531 cites W2112383564 @default.
- W2057041531 cites W2126924915 @default.
- W2057041531 cites W2147270269 @default.
- W2057041531 cites W2149907923 @default.
- W2057041531 cites W2151672566 @default.
- W2057041531 cites W2166071597 @default.
- W2057041531 cites W2170544967 @default.
- W2057041531 cites W2172260702 @default.
- W2057041531 cites W2295944892 @default.
- W2057041531 cites W4294549613 @default.
- W2057041531 doi "https://doi.org/10.1145/2597630" @default.
- W2057041531 hasPublicationYear "2014" @default.
- W2057041531 type Work @default.
- W2057041531 sameAs 2057041531 @default.
- W2057041531 citedByCount "21" @default.
- W2057041531 countsByYear W20570415312014 @default.
- W2057041531 countsByYear W20570415312015 @default.
- W2057041531 countsByYear W20570415312016 @default.
- W2057041531 countsByYear W20570415312017 @default.
- W2057041531 countsByYear W20570415312018 @default.
- W2057041531 countsByYear W20570415312019 @default.
- W2057041531 countsByYear W20570415312021 @default.
- W2057041531 countsByYear W20570415312022 @default.
- W2057041531 crossrefType "journal-article" @default.
- W2057041531 hasAuthorship W2057041531A5036421091 @default.
- W2057041531 hasAuthorship W2057041531A5042520814 @default.
- W2057041531 hasAuthorship W2057041531A5049321288 @default.
- W2057041531 hasAuthorship W2057041531A5061279024 @default.
- W2057041531 hasAuthorship W2057041531A5083822059 @default.
- W2057041531 hasBestOaLocation W20570415312 @default.
- W2057041531 hasConcept C11413529 @default.
- W2057041531 hasConcept C114614502 @default.
- W2057041531 hasConcept C118615104 @default.
- W2057041531 hasConcept C120314980 @default.
- W2057041531 hasConcept C128669082 @default.
- W2057041531 hasConcept C130120984 @default.
- W2057041531 hasConcept C134306372 @default.
- W2057041531 hasConcept C13533509 @default.
- W2057041531 hasConcept C151319957 @default.
- W2057041531 hasConcept C2778383056 @default.
- W2057041531 hasConcept C31258907 @default.
- W2057041531 hasConcept C33923547 @default.
- W2057041531 hasConcept C39927690 @default.
- W2057041531 hasConcept C41008148 @default.
- W2057041531 hasConcept C63553672 @default.
- W2057041531 hasConcept C77553402 @default.
- W2057041531 hasConcept C80444323 @default.
- W2057041531 hasConceptScore W2057041531C11413529 @default.