Advanced compiler optimizations for supercomputers
Communications of the ACM - Special issue on parallelism
The importance of direct dependences for automatic parallelization
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
Array-data flow analysis and its use in array privatization
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
Symbolic array dataflow analysis for array privatization and program parallelization
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Plugging anti and output dependence removal techniques into loop parallelization algorithm
Parallel Computing - Special double issue on environment and tools for parallel scientific computing
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
An extended ANSI C for processors with a multimedia extension
International Journal of Parallel Programming
Message-passing code generation for non-rectangular tiling transformations
Parallel Computing
| Hi-index | 0.00 |
In this paper we build upon results of Padua and Wolfe, who introduced two graph transformations to break dependence paths including anti- and output-dependences. We first formalize these two transformations. Then, given a loop nest, we aim at determining which statements should be transformed so as to break artificial dependence paths involving anti- or output-dependences. The problem of finding the minimum number of statements to be transformed is shown to be NP-complete, and we propose two efficient heuristics.