Results 1 
7 of
7
Sharedmemory mutual exclusion: Major research trends since
 Distributed Computing
, 1986
"... * Exclusion: At most one process executes its critical section at any time. ..."
Abstract

Cited by 47 (7 self)
 Add to MetaCart
* Exclusion: At most one process executes its critical section at any time.
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 (7 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...
Analysis of timingbased mutual exclusion with random times
 In Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing
, 1999
"... Abstract. Various timingbased mutual exclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorithms behave when the time for the basic operations is governed by probability distributions. In particular, we a ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. Various timingbased mutual exclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorithms behave when the time for the basic operations is governed by probability distributions. In particular, we are concerned withhow often suchalgorithms succeed in allowing a processor to obtain a critical region and how this success rate depends on the random variables involved. We explore this question in the case where operation times are governed by exponential and gamma distributions, using both theoretical analysis and simulations.
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
Timingbased mutual exclusion with local spinning
 In 17th international symposium on distributed computing, October 2003. LNCS 2848
, 2003
"... Abstract We consider the time complexity of sharedmemory mutual exclusion algorithms based on reads, writes, and comparison primitives under the remotememoryreference (RMR) time measure. For asynchronous systems, a lower bound of \Omega (log N / log log N) RMRs per criticalsection entry has been ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract We consider the time complexity of sharedmemory mutual exclusion algorithms based on reads, writes, and comparison primitives under the remotememoryreference (RMR) time measure. For asynchronous systems, a lower bound of \Omega (log N / log log N) RMRs per criticalsection entry has been established in previous work, where N is the number of processes. Also, algorithms with O(log N) time complexity are known. Thus, for algorithms in this class, logarithmic or nearlogarithmic RMR time complexity is fundamentally required.
Long Lived and Adaptive Shared Memory Implementations
, 2001
"... this paper. Motivated by their first work Moir and Anderson developed renaming algorithms, in the read/write model, when such a bound on the maximum number of processes is known in advance. This led to a sequence of works on the renaming problem in this model [MA95, MG96, BGHM95] that lead to a long ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
this paper. Motivated by their first work Moir and Anderson developed renaming algorithms, in the read/write model, when such a bound on the maximum number of processes is known in advance. This led to a sequence of works on the renaming problem in this model [MA95, MG96, BGHM95] that lead to a longlived (2K \Gamma 1)renaming algorithm with O(K ) step complexity and O(K space complexity [Moi98]. These works employed various variants of the splitter building block which is a descendant of Lamport's adaptive mutual exclusion algorithm, however the last one [Moi98] depends on an additional work which is the first longlived renaming algorithm by Burns and Peterson [BP89]
LongLived Renaming Made Adaptive (Extended Abstract)
, 1999
"... 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, ..., 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 prec...