84 search results - page 8 / 17 » Nonblocking Concurrent Data Structures with Condition Synchr... |
PODC
2011
ACM
12 years 10 months ago
2011
ACM
Maintaining data structure semantics of concurrent queues such as first-in first-out (FIFO) ordering requires expensive synchronization mechanisms which limit scalability. Howev...
ESOP
2009
Springer
14 years 2 months ago
2009
Springer
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
PPDP
2005
Springer
14 years 26 days ago
2005
Springer
In this paper we design a language and runtime support for isolation-only, multithreaded transactions (called tasks). Tasks allow isolation to be declared instead of having to be ...
PPOPP
1997
ACM
13 years 11 months ago
1997
ACM
As shared-memory multiprocessors become the dominant commodity source of computation, parallelizing compilers must support mainstream computations that manipulate irregular, point...
ISCA
1993
IEEE
13 years 11 months ago
1993
IEEE
A shared data structure is lock-free if its operations do not require mutual exclusion. If one process is interrupted in the middle of an operation, other processes will not be pr...