260 search results - page 34 / 52 » Array SSA Form and Its Use in Parallelization |
JSSPP
2004
Springer
14 years 26 days ago
2004
Springer
Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
As high-end computing systems continue to grow in scale, the performance that applications can achieve on such large scale systems depends heavily on their ability to avoid explic...
MICRO
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Parallel programming is hard, because it is impractical to test all possible thread interleavings. One promising approach to improve a multi-threaded program's relia...
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...
EMMCVPR
2005
Springer
14 years 1 months ago
2005
Springer
Traditional stereo algorithms either explicitly use the frontal parallel plane assumption by only considering position (zero-order) disparity when computing similarity measures of ...