30 search results - page 1 / 6 » Wait-Free Data Structures in the Asynchronous PRAM Model |
SPAA
1990
ACM
13 years 8 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
PDP
1997
IEEE
13 years 9 months ago
1997
IEEE
We investigate the well-known PRAM model of parallel computation as a practical parallel programming model. The two components of this project are a general-purpose PRAM programmin...
HIPC
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...
USENIX
2007
13 years 7 months ago
2007
Data Structure Abstractions for Asynchronous Web Applications Daniel S. Myers MIT CSAIL Jennifer N. Carlisle MIT CSAIL James A. Cowling MIT CSAIL Barbara H. Liskov MIT CSAIL The c...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...