Results 1 
9 of
9
WaitFree Synchronization
 ACM Transactions on Programming Languages and Systems
, 1993
"... A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lie ..."
Abstract

Cited by 733 (26 self)
 Add to MetaCart
A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lies at the heart of much recent work in concurrent algorithms, concurrent data structures, and multiprocessor architectures. In the first part of this paper, we introduce a simple and general technique, based on reduction to a consensus protocol, for proving statements of the form "there is no waitfree implementation of X by Y ." We derive a hierarchy of objects such that no object at one level has a waitfree implementation in terms of objects at lower levels. In particular, we show that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy: they cannot be used to construct waitfree implementations of many simple and familiar da...
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...
On the importance of having an identity or, is consensus really universal
 Distributed Computing
"... Abstract. We show that Naming – the existence of distinct IDs known to all – is a necessary assumption of Herlihy’s universality result for Consensus. We then show in a very precise sense that Naming is harder than Consensus and bring to the surface some important differences existing between popula ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
Abstract. We show that Naming – the existence of distinct IDs known to all – is a necessary assumption of Herlihy’s universality result for Consensus. We then show in a very precise sense that Naming is harder than Consensus and bring to the surface some important differences existing between popular shared memory models which usually remain unnoticed. 1
Randomized Naming Using WaitFree Shared Variables
 DISTRIBUTED COMPUTING
, 1998
"... A naming protocol assigns unique names (keys) to every process... ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
A naming protocol assigns unique names (keys) to every process...
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
Randomized WaitFree Concurrent Objects (Extended Abstract)
 In Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing
, 1991
"... A concurrent object is a data structure shared by concurrent processes. A waitfree implementation of a concurrent object guarantees that every operation completes in a finite number of steps, regardless of how processes interleave. It is known, however, that if concurrent processes communicate onl ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A concurrent object is a data structure shared by concurrent processes. A waitfree implementation of a concurrent object guarantees that every operation completes in a finite number of steps, regardless of how processes interleave. It is known, however, that if concurrent processes communicate only by applying read and write operations to a shared memory, then it is impossible to construct waitfree implementations of many simple and useful data objects. In this paper we show how to construct randomized waitfree implementations of longlived concurrent objects, implementations that guarantee that every operation completes in a finite expected number of steps, even against a powerful adversary. This paper will appear in the Tenth Annual ACM Symposium on Principles of Distributed Computing, August 1921, Montreal, Canada. c flDigital Equipment Corporation 1991. All rights reserved. 1 INTRODUCTION 1 1 Introduction A concurrent object is a data structure shared by asynchronous concur...
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]
1 Randomized TwoProcess WaitFree TestandSet
, 2001
"... Abstract—We present the first explicit, and currently simplest, randomized algorithm for 2process waitfree testandset. It is implemented with two 4valued single writer single reader atomic variables. A testandset takes at most 11 expected elementary steps, while a reset takes exactly 1 element ..."
Abstract
 Add to MetaCart
Abstract—We present the first explicit, and currently simplest, randomized algorithm for 2process waitfree testandset. It is implemented with two 4valued single writer single reader atomic variables. A testandset takes at most 11 expected elementary steps, while a reset takes exactly 1 elementary step. Based on a finitestate analysis, the proofs of correctness and expected length are compressed into one table.