Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
- 1 June 2006
- journal article
- Published by Springer Science and Business Media LLC in International Journal of Parallel Programming
- Vol. 34 (3), 261-317
- https://doi.org/10.1007/s10766-006-0012-3
Abstract
No abstract availableThis publication has 48 references indexed in Scilit:
- The LRPD test: speculative run-time parallelization of loops with privatization and reduction parallelizationIEEE Transactions on Parallel and Distributed Systems, 1999
- Automatic storage management for parallel programsParallel Computing, 1998
- Fuzzy Array Dataflow AnalysisJournal of Parallel and Distributed Computing, 1997
- Parallel programming with PolarisComputer, 1996
- Automating non-unimodular loop transformations for massive parallelismParallel Computing, 1994
- Mapping uniform loop nests onto distributed memory architecturesParallel Computing, 1994
- The ParaScope parallel programming environmentProceedings of the IEEE, 1993
- Some efficient solutions to the affine scheduling problem. Part II. Multidimensional timeInternational Journal of Parallel Programming, 1992
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987