{"language":[{"iso":"eng"}],"acknowledgement":"Hagit Attiya - Supported in party by Israel Science Foundation (grant number 1227/10).\r\nCorentin Travers - Additional supports from the ANR projects ALADDIN and DISPLEXITY\r\n","article_processing_charge":"No","author":[{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Hagit","last_name":"Attiya","full_name":"Attiya, Hagit"},{"last_name":"Guerraoui","first_name":"Rachid","full_name":"Guerraoui, Rachid"},{"first_name":"Corentin","last_name":"Travers","full_name":"Travers, Corentin"}],"citation":{"mla":"Alistarh, Dan-Adrian, et al. <i>Early Deciding Synchronous Renaming in O(Log f) Rounds or Less</i>. Vol. 7355 LNCS, Springer, 2012, pp. 195–206, doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">10.1007/978-3-642-31104-8_17</a>.","apa":"Alistarh, D.-A., Attiya, H., Guerraoui, R., &#38; Travers, C. (2012). Early deciding synchronous renaming in O(log f) rounds or less (Vol. 7355 LNCS, pp. 195–206). Presented at the SIROCCO: Structural Information and Communication Complexity, Springer. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">https://doi.org/10.1007/978-3-642-31104-8_17</a>","chicago":"Alistarh, Dan-Adrian, Hagit Attiya, Rachid Guerraoui, and Corentin Travers. “Early Deciding Synchronous Renaming in O(Log f) Rounds or Less,” 7355 LNCS:195–206. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">https://doi.org/10.1007/978-3-642-31104-8_17</a>.","ama":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. Early deciding synchronous renaming in O(log f) rounds or less. In: Vol 7355 LNCS. Springer; 2012:195-206. doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_17\">10.1007/978-3-642-31104-8_17</a>","short":"D.-A. Alistarh, H. Attiya, R. Guerraoui, C. Travers, in:, Springer, 2012, pp. 195–206.","ista":"Alistarh D-A, Attiya H, Guerraoui R, Travers C. 2012. Early deciding synchronous renaming in O(log f) rounds or less. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 7355 LNCS, 195–206.","ieee":"D.-A. Alistarh, H. Attiya, R. Guerraoui, and C. Travers, “Early deciding synchronous renaming in O(log f) rounds or less,” presented at the SIROCCO: Structural Information and Communication Complexity, 2012, vol. 7355 LNCS, pp. 195–206."},"publication_status":"published","month":"01","type":"conference","date_published":"2012-01-01T00:00:00Z","alternative_title":["LNCS"],"year":"2012","publist_id":"6893","status":"public","conference":{"name":"SIROCCO: Structural Information and Communication Complexity"},"extern":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","doi":"10.1007/978-3-642-31104-8_17","volume":"7355 LNCS","date_updated":"2023-02-23T13:12:41Z","day":"01","abstract":[{"lang":"eng","text":"Renaming is a fundamental problem in distributed computing, in which a set of n processes need to pick unique names from a namespace of limited size. In this paper, we present the first early-deciding upper bounds for synchronous renaming, in which the running time adapts to the actual number of failures f in the execution. We show that, surprisingly, renaming can be solved in constant time if the number of failures f is limited to O(√n), while for general f ≤ n - 1 renaming can always be solved in O(log f) communication rounds. In the wait-free case, i.e. for f = n - 1, our upper bounds match the Ω(log n) lower bound of Chaudhuri et al. [13]."}],"date_created":"2018-12-11T11:48:22Z","page":"195 - 206","title":"Early deciding synchronous renaming in O(log f) rounds or less","oa_version":"None","_id":"763"}