Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Polynomial and Adaptive Longlived (2k \Gamma 1)Renaming ?
 

Summary: Polynomial and Adaptive Long­lived
(2k \Gamma 1)­Renaming ?
(Extended Abstract)
Hagit Attiya and Arie Fouren
Department of Computer Science, The Technion, Haifa 32000, Israel
Abstract. In the long­lived M­renaming problem, processes repeatedly
obtain and release new names taken from a domain of size M . This
paper presents the first polynomial algorithm for long­lived (2k \Gamma 1)­
renaming. The algorithm is adaptive as its step complexity is O(k 4 ); here
k is the point contention---the maximal number of simultaneously active
processes in some point of the execution. Polynomial step complexity is
achieved by having processes help each other to obtain new names, while
adaptiveness is achieved by a novel application of sieves.
1 Introduction
Distributed coordination algorithms are designed to accommodate a large num­
ber of processes, each with a distinct identifier. Often, only a few processes
simultaneously participate in the coordination algorithm [19]. In this case, it is
worthwhile to rename the participating processes [6, 21]: Before starting the co­
ordination algorithm, a process uses getName to obtain a unique new name---a
positive integer in the range f1; : : : ; Mg; the process then performs the coordi­

  

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

 

Collections: Computer Technologies and Information Sciences