{"year":"2013","acknowledgement":"Dan Alistarh - This author was supported by the SNF Postdoctoral Fellows Program, NSF grant CCF-1217921, DoE ASCR grant\r\nER26116/DE-SC0008923,  and  by  grants  from  the  Oracle\r\nand Intel corporations.\r\nJames Aspnes - Supported in part by NSF grant CCF-0916389.\r\nGeorge Giakkoupis - This work was funded in part by INRIA Associate Team\r\nRADCON, and ERC Starting Grant GOSSPLE 204742.\r\nPhilipp Woelfel - This research was undertaken, in part, thanks to funding\r\nfrom the Canada Research Chairs program and the HP Labs\r\nInnovation Research Program.","oa_version":"None","date_published":"2013-01-01T00:00:00Z","extern":"1","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"},{"first_name":"James","full_name":"Aspnes, James","last_name":"Aspnes"},{"first_name":"George","full_name":"Giakkoupis, George","last_name":"Giakkoupis"},{"first_name":"Philipp","full_name":"Woelfel, Philipp","last_name":"Woelfel"}],"abstract":[{"lang":"eng","text":"Renaming is a classic distributed coordination task in which a set of processes must pick distinct identifiers from a small namespace. In this paper, we consider the time complexity of this problem when the namespace is linear in the number of participants, a variant known as loose renaming. We give a non-adaptive algorithm with O(log log n) (individual) step complexity, where n is a known upper bound on contention, and an adaptive algorithm with step complexity O((log log k)2), where k is the actual contention in the execution. We also present a variant of the adaptive algorithm which requires O(k log log k) total process steps. All upper bounds hold with high probability against a strong adaptive adversary. We complement the algorithms with an ω(log log n) expected time lower bound on the complexity of randomized renaming using test-and-set operations and linear space. The result is based on a new coupling technique, and is the first to apply to non-adaptive randomized renaming. Since our algorithms use O(n) test-and-set objects, our results provide matching bounds on the cost of loose renaming in this setting."}],"citation":{"apa":"Alistarh, D.-A., Aspnes, J., Giakkoupis, G., &#38; Woelfel, P. (2013). Randomized loose renaming in O(loglogn) time (pp. 200–209). Presented at the PODC: Principles of Distributed Computing, ACM. <a href=\"https://doi.org/10.1145/2484239.2484240\">https://doi.org/10.1145/2484239.2484240</a>","chicago":"Alistarh, Dan-Adrian, James Aspnes, George Giakkoupis, and Philipp Woelfel. “Randomized Loose Renaming in O(Loglogn) Time,” 200–209. ACM, 2013. <a href=\"https://doi.org/10.1145/2484239.2484240\">https://doi.org/10.1145/2484239.2484240</a>.","ama":"Alistarh D-A, Aspnes J, Giakkoupis G, Woelfel P. Randomized loose renaming in O(loglogn) time. In: ACM; 2013:200-209. doi:<a href=\"https://doi.org/10.1145/2484239.2484240\">10.1145/2484239.2484240</a>","ieee":"D.-A. Alistarh, J. Aspnes, G. Giakkoupis, and P. Woelfel, “Randomized loose renaming in O(loglogn) time,” presented at the PODC: Principles of Distributed Computing, 2013, pp. 200–209.","ista":"Alistarh D-A, Aspnes J, Giakkoupis G, Woelfel P. 2013. Randomized loose renaming in O(loglogn) time. PODC: Principles of Distributed Computing, 200–209.","short":"D.-A. Alistarh, J. Aspnes, G. Giakkoupis, P. Woelfel, in:, ACM, 2013, pp. 200–209.","mla":"Alistarh, Dan-Adrian, et al. <i>Randomized Loose Renaming in O(Loglogn) Time</i>. ACM, 2013, pp. 200–09, doi:<a href=\"https://doi.org/10.1145/2484239.2484240\">10.1145/2484239.2484240</a>."},"publist_id":"6889","_id":"765","language":[{"iso":"eng"}],"type":"conference","conference":{"name":"PODC: Principles of Distributed Computing"},"date_created":"2018-12-11T11:48:23Z","publisher":"ACM","title":"Randomized loose renaming in O(loglogn) time","date_updated":"2023-02-23T13:13:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","publication_status":"published","day":"01","status":"public","doi":"10.1145/2484239.2484240","page":"200 - 209","article_processing_charge":"No"}