PPOPP
2012
ACM
12 years 21 hour ago
2012
ACM
The linked-list data structure is fundamental and ubiquitous. Lockfree versions of the linked-list are well known. However, the existence of a practical wait-free linked-list has ...
PPOPP
2012
ACM
12 years 21 hour ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
PPOPP
2012
ACM
12 years 21 hour ago
2012
ACM
This paper introduces a programming interface called PARRAY (or Parallelizing ARRAYs) that supports system-level succinct programming for heterogeneous parallel systems like GPU c...
PPOPP
2012
ACM
12 years 21 hour ago
2012
ACM
The efforts of an expert to parallelize and optimize a dense linear algebra algorithm for distributed-memory targets are largely mechanical and repetitive. We demonstrate that the...
PPOPP
2012
ACM
12 years 22 hour 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...
PPOPP
2012
ACM
12 years 22 hour 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 ...
PPOPP
2012
ACM
12 years 22 hour 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...
PPOPP
2012
ACM
12 years 22 hour 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...
PPOPP
2012
ACM
12 years 22 hour 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...
PPOPP
2012
ACM
12 years 22 hour 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. ...