Citation for published item: ferenrinkD etr nd frinkmnnD endr¡ e nd ils¤ sserD oert nd priedetzkyD om nd xgelD vrs @PHISA 9ndomized renming in shred memory systemsF9D in PHIS siii PWth snterntionl rllel nd histriuted roessing ymposium @sh PHISAD PS!PW wy PHISD ryderdD sndi Y proeedingsF vos elmitosX siiiD ppF SRPESRWF rllel nd histriuted roessing ymposium @shAF Further information on publisher's website: httpXGGdxFdoiForgGIHFIIHWGshFPHISFUU Publisher's copyright statement: c 2015 IEEE. Personal

more »

... use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. Additional information: Use policy The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full DRO policy for further details. Abstract-Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m. The problem is called tight if m = n, and loose if m > n. In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O(log n) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = (1 + ) · n and constant , they achieve a step complexity of O(log log n). In this paper we consider tight as well as loose renaming and introduce randomized algorithms that achieve their tasks with high probability. The model assumed is the asynchronous shared memory model against an adaptive adversary. Our algorithm for loose renaming maps n processes to a name space of size m = (1 + 2/(log n) ) · n = (1 + o(1)) · n performing O( · (log log n) 2 ) test-and-set operations. In the case of tight renaming, we present a protocol that assigns n processes to n names with step complexity O(log n), but without the overhead and impracticality of the AKS network. This algorithm utilizes modern hardware features in form of a counting device which is also described in the paper. This device may have the potential to speed up other distributed algorithms as well.