31 search results - page 1 / 7 » ppopp 2010 |
77
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
96
Voted
PPOPP
2010
ACM
15 years 5 months ago
2010
ACM
92
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
Transactional memory promises to make parallel programming easier than with fine-grained locking, while performing just as well. This performance claim is not always borne out bec...
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
This paper addresses the problem of extracting coarse-grained parallelism from large sequential code. It builds on BOP, a system for software speculative parallelization. BOP lets...
121
Voted
PPOPP
2010
ACM
15 years 10 months ago
2010
ACM
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...