7092 search results - page 976 / 1419 » Parallelizing constraint programs |
206
click to vote
TPDS
2002
15 years 6 months ago
2002
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
203
click to vote
HPCA
2011
IEEE
14 years 10 months ago
2011
IEEE
Most shared memory systems maximize performance by unpredictably resolving memory races. Unpredictable memory races can lead to nondeterminism in parallel programs, which can suff...
235
click to vote
HPCA
2011
IEEE
14 years 10 months ago
2011
IEEE
Contention management is an important design component to a transactional memory system. Without effective contention management to ensure forward progress, a transactional memory...
205
click to vote
HPDC
2011
IEEE
14 years 10 months ago
2011
IEEE
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...
241
click to vote
HPDC
2011
IEEE
14 years 10 months ago
2011
IEEE
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...