272 search results - page 23 / 55 » Code Transformations to Improve Memory Parallelism |
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Recent advances in polyhedral compilation technology have made it feasible to automatically transform affine sequential loop nests for tiled parallel execution on multi-core proce...
INFORMATICALT
2006
13 years 8 months ago
2006
The paper describes the development and performance of parallel algorithms for the discrete element method (DEM) software. Spatial domain decomposition strategy and message passing...
IEEEPACT
1998
IEEE
14 years 26 days ago
1998
IEEE
Register coalescing is used, as part of register allocation, to reduce the number of register copies. Developing efficient register coalescing heuristics is particularly important ...
LISP
2008
13 years 8 months ago
2008
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
FTTCS
2006
13 years 8 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...