Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Fast Randomized Test-and-Set and Renaming Dan Alistarh1
 

Summary: Fast Randomized Test-and-Set and Renaming
Dan Alistarh1
, Hagit Attiya1,2
,
Seth Gilbert3
, Andrei Giurgiu1
, and Rachid Guerraoui1
1
Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland
2
Technion, Haifa, Israel
3
National University of Singapore
Abstract. Most people believe that renaming is easy: simply choose a name at
random; if more than one process selects the same name, then try again. We high-
light the issues that occur when trying to implement such a scheme and shed new
light on the read-write complexity of randomized renaming in an asynchronous
environment. At the heart of our new perspective stands an adaptive implemen-
tation of a randomized test-and-set object, that has poly-logarithmic step com-
plexity per operation, with high probability. Interestingly, our implementation is

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology
Guerraoui, Rachid - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences