An affine partitioning algorithm to maximize parallelism and minimize communication
Authors:
Open Access
- 1 May 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 228-237
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Maximizing parallelism and minimizing synchronization with affine partitionsParallel Computing, 1998
- Data-centric multi-level blocking1997
- Minimizing communication while preserving parallelism1996
- Data and computation transformations for multiprocessors1995
- Compiler optimizations for eliminating barrier synchronization1995
- Global optimizations for parallelism and locality on scalable parallel machines1993
- Some efficient solutions to the affine scheduling problem. I. One-dimensional timeInternational Journal of Parallel Programming, 1992
- A loop transformation theory and an algorithm to maximize parallelismIEEE Transactions on Parallel and Distributed Systems, 1991
- Advanced compiler optimizations for supercomputersCommunications of the ACM, 1986
- Dependence graphs and compiler optimizations1981