201 search results - page 25 / 41 » Estimating the Parallel Start-Up Overhead for Parallelizing ... |
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
To achieve high-performance on multicore systems, sharedmemory parallel languages must efficiently implement atomic operations. The commonly used and studied paradigms for atomici...
SPAA
2009
ACM
14 years 4 months ago
2009
ACM
In this paper, we identify transaction-local memory as a major source of overhead from compiler instrumentation in software transactional memory (STM). Transaction-local memory is...
PLDI
2004
ACM
14 years 29 days ago
2004
ACM
With billion-transistor chips on the horizon, single-chip multiprocessors (CMPs) are likely to become commodity components. Speculative CMPs use hardware to enforce dependence, al...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
The fth release of the multithreaded language Cilk uses a provably good \work-stealing" scheduling algorithm similar to the rst system, but the language has been completely r...
PPOPP
2010
ACM
14 years 4 months ago
2010
ACM
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...