Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 350-368
- https://doi.org/10.1007/bfb0017263
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Reduction of cache coherence overhead by compiler data layout and loop transformationPublished by Springer Nature ,2006
- Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1995
- Unifying data and control transformations for distributed shared-memory machinesPublished by Association for Computing Machinery (ACM) ,1995
- The MIT Alewife machinePublished by Association for Computing Machinery (ACM) ,1995
- Compiler optimizations for improving data localityPublished by Association for Computing Machinery (ACM) ,1994
- Global optimizations for parallelism and locality on scalable parallel machinesPublished by Association for Computing Machinery (ACM) ,1993
- Compiling Fortran D for MIMD distributed-memory machinesCommunications of the ACM, 1992
- Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputersIEEE Transactions on Parallel and Distributed Systems, 1992
- Compile-time partitioning of iterative parallel loops to reduce cache coherency trafficIEEE Transactions on Parallel and Distributed Systems, 1991
- Data optimization: Allocation of arrays to reduce communication on SIMD machinesJournal of Parallel and Distributed Computing, 1990