Array-data flow analysis and its use in array privatization
Dror E. Maydan, Saman P. Amarasinghe, Monica S. Lam · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1993
Data-flow analysis of scalar variables and data dependence analysis on array elements are two important program analyses used in optimizing and parallelizing compilers. Traditional data-flow analysis models accesses of array elements simply as accesses to the entire array, and is inadequate for parallelizing loops in array-based programs. On the other hand, data dependence analysis differentiates between different array elements but is flow-insensitive.
Cited by 166 works. doi:10.1145/158511.158515
Authors
References
- The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers
- Dependence Analysis for Supercomputing
- The Omega test: a fast and practical integer programming algorithm for dependence analysis
- Dataflow analysis of array and scalar references
- Efficient and exact data dependence analysis
- Scanning polyhedra with DO loops
- Parametric integer programming
- Automatic decomposition of scientific programs for parallel execution
- Eliminating false data dependences using the Omega test
- Experience in the automatic parallelization of four Perfect-Benchmark programs