{"language":[{"iso":"eng"}],"publist_id":"6897","date_created":"2018-12-11T11:48:22Z","article_processing_charge":"No","conference":{"name":"PODC: Principles of Distributed Computing"},"date_updated":"2023-02-23T13:12:17Z","_id":"761","extern":"1","acknowledgement":"We would like to thank Hagit Attiya, Rachid Guerraoui\r\nand Prasad Jayanti for useful discussions and support.  We\r\nwould also like to thank the anonymous reviewers for many\r\nuseful comments.","publication_status":"published","author":[{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Aspnes","first_name":"James","full_name":"Aspnes, James"},{"first_name":"Keren","last_name":"Censor Hillel","full_name":"Censor Hillel, Keren"},{"first_name":"Seth","last_name":"Gilbert","full_name":"Gilbert, Seth"},{"full_name":"Zadimoghaddam, Morteza","last_name":"Zadimoghaddam","first_name":"Morteza"}],"doi":"10.1145/1993806.1993850","month":"01","date_published":"2011-01-01T00:00:00Z","publisher":"ACM","abstract":[{"lang":"eng","text":"We give two new randomized algorithms for strong renaming, both of which work against an adaptive adversary in asynchronous shared memory. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of n processes with step complexity O(log3 n). The second transforms any sorting network into a strong adaptive renaming protocol, with an expected cost equal to the depth of the sorting network. Using an AKS sorting network, this gives a strong adaptive renaming algorithm with step complexity O(log k), where k is the contention in the current execution. We show this to be optimal based on a classic lower bound of Jayanti. We also show that any such strong renaming protocol can be used to build a monotone-consistent counter with logarithmic step complexity (at the cost of adding a max register) or a linearizable fetch-and-increment register (at the cost of increasing the step complexity by a logarithmic factor)."}],"oa_version":"None","citation":{"short":"D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, M. Zadimoghaddam, in:, ACM, 2011, pp. 239–248.","ama":"Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. Optimal-time adaptive strong renaming, with applications to counting. In: ACM; 2011:239-248. doi:<a href=\"https://doi.org/10.1145/1993806.1993850\">10.1145/1993806.1993850</a>","apa":"Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., &#38; Zadimoghaddam, M. (2011). Optimal-time adaptive strong renaming, with applications to counting (pp. 239–248). Presented at the PODC: Principles of Distributed Computing, ACM. <a href=\"https://doi.org/10.1145/1993806.1993850\">https://doi.org/10.1145/1993806.1993850</a>","chicago":"Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert, and Morteza Zadimoghaddam. “Optimal-Time Adaptive Strong Renaming, with Applications to Counting,” 239–48. ACM, 2011. <a href=\"https://doi.org/10.1145/1993806.1993850\">https://doi.org/10.1145/1993806.1993850</a>.","mla":"Alistarh, Dan-Adrian, et al. <i>Optimal-Time Adaptive Strong Renaming, with Applications to Counting</i>. ACM, 2011, pp. 239–48, doi:<a href=\"https://doi.org/10.1145/1993806.1993850\">10.1145/1993806.1993850</a>.","ista":"Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. 2011. Optimal-time adaptive strong renaming, with applications to counting. PODC: Principles of Distributed Computing, 239–248.","ieee":"D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and M. Zadimoghaddam, “Optimal-time adaptive strong renaming, with applications to counting,” presented at the PODC: Principles of Distributed Computing, 2011, pp. 239–248."},"day":"01","status":"public","year":"2011","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"239 - 248","title":"Optimal-time adaptive strong renaming, with applications to counting"}