Blocking and array contraction across arbitrarily nested loops using affine partitioning
- 18 June 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 36 (7) , 103-112
- https://doi.org/10.1145/379539.379586
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An affine partitioning algorithm to maximize parallelism and minimize communicationPublished by Association for Computing Machinery (ACM) ,1999
- The implementation and evaluation of fusion and contraction in array languagesPublished by Association for Computing Machinery (ACM) ,1998
- Maximizing parallelism and minimizing synchronization with affine partitionsParallel Computing, 1998
- Data-centric multi-level blockingPublished by Association for Computing Machinery (ACM) ,1997
- Maximizing parallelism and minimizing synchronization with affine transformsPublished by Association for Computing Machinery (ACM) ,1997
- Compiler transformations for high-performance computingACM Computing Surveys, 1994
- Compiler optimizations for improving data localityPublished by Association for Computing Machinery (ACM) ,1994
- Some efficient solutions to the affine scheduling problem. I. One-dimensional timeInternational Journal of Parallel Programming, 1992
- A data locality optimizing algorithmPublished by Association for Computing Machinery (ACM) ,1991
- Solution of the Euler equations for two dimensional transonic flow by a multigrid methodApplied Mathematics and Computation, 1983