227
click to vote
PPOPP
2011
ACM
14 years 10 months ago
2011
ACM
Developing parallel software using current tools can be challenging. Even experts find it difficult to reason about the use of locks and often accidentally introduce race condit...
228
click to vote
PPOPP
2011
ACM
14 years 10 months ago
2011
ACM
We describe two novel constructs for programming parallel machines with multi-level memory hierarchies: call-up, which allows a child task to invoke computation on its parent, and...
285
click to vote
PPOPP
2011
ACM
14 years 10 months ago
2011
ACM
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
256
click to vote
PPOPP
2011
ACM
14 years 10 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
233
click to vote
PPOPP
2011
ACM
14 years 10 months ago
2011
ACM
We propose a cooperative methodology for multithreaded software, where threads use traditional synchronization idioms such as locks, but additionally document each point of potent...