A New Algorithm for Global Optimization for Parallelism and Locality


Converting sequential programs to execute on parallel computers is diicult because of the need to globally optimize for both par-allelism and data locality. The choice of which loop nests to parallelize, and how, drastically aaects data locality. Similarly, data distribution directives, such as DISTRIBUTE in High Performance Fortran (HPF), affects available… (More)
DOI: 10.1007/BFb0025875