Results 1  10
of
231,968
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 873 (28 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
General Terms
"... The linkedlist data structure is fundamental and ubiquitous. Lockfree versions of the linkedlist are well known. However, the existence of a practical waitfree linkedlist has been open. In this work we designed such a linkedlist. To achieve better performance, we have also extended this design ..."
Abstract
 Add to MetaCart
The linkedlist data structure is fundamental and ubiquitous. Lockfree versions of the linkedlist are well known. However, the existence of a practical waitfree linkedlist has been open. In this work we designed such a linkedlist. To achieve better performance, we have also extended this design
Algorithms, Performance
"... Lockfreedom is a progress guarantee that ensures overall program progress. Waitfreedom is a stronger progress guarantee that ensures the progress of each thread in the program. While many practical lockfree algorithms exist, waitfree algorithms are typically inefficient and hardly used in practi ..."
Notes on WaitFree Spans
, 1998
"... simplicial complexes and maps. The topological spaces that arise in the study of faulttolerant computation in asynchronous distributed systems are given by discrete data, such as configurations of input values for the processes. These spaces can be described using simplicial complexes. In this sub ..."
Abstract
 Add to MetaCart
simplicial complexes and maps. The topological spaces that arise in the study of faulttolerant computation in asynchronous distributed systems are given by discrete data, such as configurations of input values for the processes. These spaces can be described using simplicial complexes. In this subsection we give a host of definitions. Abstractly, a simplicial complex is a family K of nonempty finite sets that satisfies the following hereditary property : if X 2 K and X 0 is a nonempty subset of X , then X 0 2 K. A subset L ` K is a subcomplex if L is a simplicial complex, which simply means that L itself satisfies the hereditary property. Given any set K of nonempty finite sets, one may form a simplicial complex K by adding any missing sets required by the hereditary property: K = fX 0 : ; 6= X 0 ` X for some X 2 Kg : The complex K formed in this fashion is said to be generated by the set K. An element X 2 K is called a simplex , and the elements of X are its vertice...
Transparent Support for WaitFree Transactions
 In Proceedings of the 11th International Workshop on Distributed Algorithms
, 1997
"... . This paper concerns software support for nonblocking transactions in sharedmemory multiprocessors. We present mechanisms that convert sequential transactions into lockfree or waitfree ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory locations ..."
Abstract

Cited by 57 (7 self)
 Add to MetaCart
. This paper concerns software support for nonblocking transactions in sharedmemory multiprocessors. We present mechanisms that convert sequential transactions into lockfree or waitfree ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory
Almost Waitfree Resizable Hashtables
"... In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor faulttolerance. Waitfree and lockfree algorithms can do without locking mechanisms, and therefore do not suffer from these problems. We present an efficient almost waitfree algorithm ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In multiprogrammed systems, synchronization often turns out to be a performance bottleneck and the source of poor faulttolerance. Waitfree and lockfree algorithms can do without locking mechanisms, and therefore do not suffer from these problems. We present an efficient almost waitfree
The Dynamics of WaitFree Distributed Computations
, 1996
"... ion The basic idea here is to look only at the input/output relations that a given program induces. This is the ordinary denotational view on the semantics of the program (CC92). Formally we define an abstract domain of denotations of programs as D = (fPg \Theta ZZ ? ) 2 [ (fP 0 g \Theta ZZ ? ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ion The basic idea here is to look only at the input/output relations that a given program induces. This is the ordinary denotational view on the semantics of the program (CC92). Formally we define an abstract domain of denotations of programs as D = (fPg \Theta ZZ ? ) 2 [ (fP 0 g \Theta ZZ ? ) 2 Note the slight difference with a standard (relational) denotational semantics. Instead of computing relations between pairs of values computed by P and Q, we look at solo executions of P and solo executions of Q, i.e. we compute relations between values of P or relations between values of Q. Let us be more formal now. Let p I (fR; Sg; ae) = (P; ae(u)) pO (fR; Sg; ae) = (P; ae(x)) q I (fR; Sg; ae) = (P 0 ; ae(v)) q O (fR; Sg; ae) = (P 0 ; ae(y)) Then the abstraction ff from the transition systems defining the semantics of our E. Goubault 6 language (forming a lattice T with the inclusion of transition systems as order) to the domain D (which is a lattice with the inclusion of r...
WaitFree Data Structures in the Asynchronous PRAM Model
 In Proceedings of the 2nd Annual Symposium on Parallel Algorithms and Architectures
, 2000
"... In the asynchronous PRAM model, processes communicate by atomically reading and writing shared memory locations. This paper investigates the extent to which asynchronous PRAM permits longlived, highly concurrent data structures. An implementation of a concurrent object is waitfree if every operati ..."
Abstract

Cited by 62 (13 self)
 Add to MetaCart
In the asynchronous PRAM model, processes communicate by atomically reading and writing shared memory locations. This paper investigates the extent to which asynchronous PRAM permits longlived, highly concurrent data structures. An implementation of a concurrent object is waitfree if every
Implementing WaitFree Objects on PriorityBased Systems
 In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing
, 1997
"... Waitfree objects are often implemented through the use of a "helping scheme", whereby one process "helps" one or more other processes to complete an operation. This paper presents several new helping schemes that can be generally applied to efficiently implement a variety of dif ..."
Abstract

Cited by 27 (10 self)
 Add to MetaCart
of these schemes by presenting waitfree implementations of linked lists and a multiword compareandswap primitive. 1 Introduction We consider the implementation of waitfree shared objects on multiprogrammed systems in which processes are scheduled for execution based on priority. We assume that processes
Waitfree Parallel Algorithms for the UnionFind Problem
 In Proc. 23rd ACM Symposium on Theory of Computing
, 1994
"... We are interested in designing efficient data structures for a shared memory multiprocessor. In this paper we focus on the UnionFind data structure. We consider a fully asynchronous model of computation where arbitrary delays are possible. Thus we require our solutions to the data structure problem ..."
Abstract

Cited by 54 (0 self)
 Add to MetaCart
problem have the waitfree property, meaning that each thread continues to make progress on its operations, independent of the speeds of the other threads. In this model efficiency is best measured in terms of the total number of instructions used to perform a sequence of data structure operations
Results 1  10
of
231,968