{"publication":"Journal of the ACM","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T13:14:09Z","month":"05","title":"Tight bounds for asynchronous renaming","publisher":"ACM","article_processing_charge":"No","status":"public","doi":"10.1145/2597630","publication_status":"published","day":"01","date_created":"2018-12-11T11:48:24Z","issue":"3","citation":{"chicago":"Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Rachid Guerraoui. “Tight Bounds for Asynchronous Renaming.” <i>Journal of the ACM</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2597630\">https://doi.org/10.1145/2597630</a>.","apa":"Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., &#38; Guerraoui, R. (2014). Tight bounds for asynchronous renaming. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/2597630\">https://doi.org/10.1145/2597630</a>","mla":"Alistarh, Dan-Adrian, et al. “Tight Bounds for Asynchronous Renaming.” <i>Journal of the ACM</i>, vol. 61, no. 3, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2597630\">10.1145/2597630</a>.","short":"D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, R. Guerraoui, Journal of the ACM 61 (2014).","ista":"Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Guerraoui R. 2014. Tight bounds for asynchronous renaming. Journal of the ACM. 61(3).","ieee":"D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and R. Guerraoui, “Tight bounds for asynchronous renaming,” <i>Journal of the ACM</i>, vol. 61, no. 3. ACM, 2014.","ama":"Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Guerraoui R. Tight bounds for asynchronous renaming. <i>Journal of the ACM</i>. 2014;61(3). doi:<a href=\"https://doi.org/10.1145/2597630\">10.1145/2597630</a>"},"publist_id":"6887","abstract":[{"lang":"eng","text":"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 ω(klog(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."}],"author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"},{"last_name":"Aspnes","full_name":"Aspnes, James","first_name":"James"},{"first_name":"Keren","full_name":"Censor Hillel, Keren","last_name":"Censor Hillel"},{"first_name":"Seth","full_name":"Gilbert, Seth","last_name":"Gilbert"},{"first_name":"Rachid","last_name":"Guerraoui","full_name":"Guerraoui, Rachid"}],"type":"journal_article","language":[{"iso":"eng"}],"_id":"769","year":"2014","volume":61,"extern":"1","intvolume":"        61","date_published":"2014-05-01T00:00:00Z","oa_version":"None","acknowledgement":"The work of J. Aspnes was supported in part by NSF grant CCF-0916389. The work of S. Gilbert was\r\nsupported by Singapore AcRF-2 MOE 2011-T2-2-042.\r\nK. Censor-Hillel is a Shalon Fellow. Part of this work was performed while K. Censor-Hillel was a postdoc at\r\nMIT, supported by the Simons Postdoctoral Fellowship."}