144
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
We present Dynamic Out-of-Order Java (DOJ), a dynamic parallelization approach. In DOJ, a developer annotates code blocks as tasks to decouple these blocks from the parent executi...
151
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
189
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
127
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
CPHASH is a concurrent hash table for multicore processors. CPHASH partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partit...
157
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
In program debugging, reproducibility of bugs is a key requirement. Unfortunately, bugs in concurrent programs are notoriously difficult to reproduce because bugs due to concurre...
140
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
167
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
Graphics processing units (GPUs) are powerful devices capable of rapid parallel computation. GPU programming, however, can be quite difficult, limiting its use to experienced prog...
136
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
160
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
156
click to vote
PPOPP
2012
ACM
14 years 8 days ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...