Results 1 
9 of
9
Adaptive LongLived Renaming Using Bounded Memory (Extended Abstract)
 PROC. OF THE 40TH IEEE ANN. SYMP. ON FOUNDATIONS OF COMPUTER SCIENCE
, 1999
"... This paper addresses the properties and design of longlived adaptive algorithms in the read/write shared memory model. In particular we present adaptive and longlived algorithms that adapt to the point contention of an operation while using only a bounded amount of memory. We believe the techn ..."
Abstract

Cited by 19 (8 self)
 Add to MetaCart
This paper addresses the properties and design of longlived adaptive algorithms in the read/write shared memory model. In particular we present adaptive and longlived algorithms that adapt to the point contention of an operation while using only a bounded amount of memory. We believe the techniques and building blocks developed here to be of further use in the design of adaptive and longlived algorithms. We use the renaming problem as a testcase to demonstrate the new techniques and properties. Three new implementations of adaptive, waitfree, and longlived renaming in the read/write shared memory model are presented. Unlike previous algorithms [1] the three algorithms require a bounded number of registers and adapt to the point contention of an operation. The two previous algorithms presented in [1] either adapt to the point contention or use a bounded size memory...
Long Lived Adaptive Splitter and Applications
, 1999
"... this paper we were able to define and implement a variant of the MoirAnderson splitter that does not have all the properties that their splitter has but on the other hand, has an adaptive and longlived implementation. Furthermore, we use this splitter as a building block in constructions other tha ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
this paper we were able to define and implement a variant of the MoirAnderson splitter that does not have all the properties that their splitter has but on the other hand, has an adaptive and longlived implementation. Furthermore, we use this splitter as a building block in constructions other than a grid (for example a row of splitters or a tree of splitters) and in this way implement diverse applications such as mutual exclusion and optimal name space renaming
Adaptive WaitFree Algorithms for Asynchronous SharedMemory Systems
, 2001
"... ACKNOWLEDGEMENTS The generous financial help of Technion is gratefully acknowledged First of all, I thank Prof. Hagit Attiya for her excellent guidance, for knowledge, experience and time that she has given me throughout all stages of the work. Thanks to Prof. Yehuda Afek, Dr. Dan Touitou and Dr. Gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
ACKNOWLEDGEMENTS The generous financial help of Technion is gratefully acknowledged First of all, I thank Prof. Hagit Attiya for her excellent guidance, for knowledge, experience and time that she has given me throughout all stages of the work. Thanks to Prof. Yehuda Afek, Dr. Dan Touitou and Dr. Gideon Stupp for their friendship, help and support, particularly during the PODC98 conference. I would like to thank Prof. Eli Gafni for his insight and for very helpful discussions. I owe a depth of gratitude to Rabbi Yosef Brook who encouraged me to continue studies towards Ph.D. degree, and to Rabbi Nachum Diamont for his wise advise and help.
Adaptive Algorithms Utilyzing Adaptive Collect and Snapshot
, 1999
"... Several adaptive algorithms are automatically generated via a simple transformation from singlewriter multireader algorithms, using the O(k) adaptive collect algorithm of Attiya and Fouren [AF98a]. Among these algorithms are an adaptive snapshot algorithm with step complexity O(k 2 ), and th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Several adaptive algorithms are automatically generated via a simple transformation from singlewriter multireader algorithms, using the O(k) adaptive collect algorithm of Attiya and Fouren [AF98a]. Among these algorithms are an adaptive snapshot algorithm with step complexity O(k 2 ), and three algorithms solving (2k \Gamma 1)renaming, but with high step complexities (k4 k , \Omega\Gamma/ k=2 ), and k 3 ), where k is the contention, the number of processes actually taking steps during the run of the algorithm. The transformation does not always produce an adaptive algorithm: the O(n log n) latticeagreement (one shot snapshot) algorithm of Attiya and Rachman [AR93] is one example. However, we show that a simple modification of the original algorithm allows the transformation to produce an adaptive, O(k log k) latticeagreement algorithm, matching the bestknown step complexity of Attiya and Fouren's algorithm [AF98]. Finally, we present a speciallytailored algori...
A Polynomial Adaptive Algorithm for LongLived (2k  1)Renaming
, 2003
"... This paper presents an algorithm for longlived renaming with optimal name space and polynomial adaptive step complexity. Processes dynamically get and release names in the range f1; : ::; 2k \Gamma 1g, where k is the maximal number of processes concurrently active (the point contention). The algori ..."
Abstract
 Add to MetaCart
This paper presents an algorithm for longlived renaming with optimal name space and polynomial adaptive step complexity. Processes dynamically get and release names in the range f1; : ::; 2k \Gamma 1g, where k is the maximal number of processes concurrently active (the point contention). The algorithm has O(k³) step complexity, where k is the point contention. Executions with exponential step complexity are constructed for previously known longlived renaming algorithms, thus showing that ours is the first longlived renaming algorithm with polynomial step complexity.
LongLived Renaming Made Adaptive (Extended Abstract)
"... Two implementations of an adaptive, waitfree, and longlived renaming task in the read/write shared memory model are presented. Implementations of longlived and adaptive objects were previously known only in the much stronger model of loadlinked and storeconditional (i.e., readmodifywrite) shar ..."
Abstract
 Add to MetaCart
Two implementations of an adaptive, waitfree, and longlived renaming task in the read/write shared memory model are presented. Implementations of longlived and adaptive objects were previously known only in the much stronger model of loadlinked and storeconditional (i.e., readmodifywrite) shared memory. In read/write sharedmemory only oneshot adaptive objects are known. Presented here are two algorithms that assign a new unique id in the range 1; \Delta \Delta \Delta ; O(k²) to any process whose initial unique name is taken from a set of size N , for an arbitrary N and where k is the number of processors that actually take steps or hold a name while the new name is being acquired. The step complexity of acquiring a new name is respectively O(k²) and O(k² log k), while the step complexity of releasing a name is 1. The main differences between the two algorithms are in the preci...
Polynomial and Adaptive Longlived (2k1)Renaming (Extended Abstract)
, 2000
"... ) Hagit Attiya and Arie Fouren Department of Computer Science, The Technion, Haifa 32000, Israel Abstract. In the longlived Mrenaming problem, processes repeatedly obtain and release new names taken from a domain of size M . This paper presents the first polynomial algorithm for longlived (2 ..."
Abstract
 Add to MetaCart
) Hagit Attiya and Arie Fouren Department of Computer Science, The Technion, Haifa 32000, Israel Abstract. In the longlived Mrenaming problem, processes repeatedly obtain and release new names taken from a domain of size M . This paper presents the first polynomial algorithm for longlived (2k \Gamma 1) renaming. The algorithm is adaptive as its step complexity is O(k 4 ); here k is the point contentionthe 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 number 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 t...