Sciweavers

2609 search results - page 9 / 522
» Optimizing for parallelism and data locality
Sort
View
SPAA
2000
ACM
15 years 2 months ago
The data locality of work stealing
Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe
IPPS
2005
IEEE
15 years 3 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules
Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore...
Sebastian Gerlach, Roger D. Hersch
IPPS
2003
IEEE
15 years 3 months ago
Lazy Parallelization: A Finite State Machine Based Optimization Approach for Data Parallel Image Processing Applications
Performance obtained with existing library-based parallelization tools for implementing high performance image processing applications is often sub-optimal. This is because inter-...
Frank J. Seinstra, Dennis Koelma
CC
2008
Springer
193views System Software» more  CC 2008»
14 years 12 months ago
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
The polyhedral model provides powerful abstractions to optimize loop nests with regular accesses. Affine transformations in this model capture a complex sequence of execution-reord...
Uday Bondhugula, Muthu Manikandan Baskaran, Sriram...