An implementation of interprocedural bounded regular section analysis
Paul Havlak, Ken Kennedy · IEEE Transactions on Parallel and Distributed Systems · 1991
Regular section analysis, which summarizes interprocedural side effects on subarrays in a form useful to dependence analysis, while avoiding the complexity of prior solutions, is shown to be a practical addition to a production compiler. Optimizing compilers should produce efficient code even in the presence of high-level language constructs. However, current programming support systems are significantly lacking in their ability to analyze procedure calls. This deficiency complicates parallel programming, because loops with calls can be a significant source of parallelism. The performance of regular section analysis is compared to two benchmarks: the LINPACK library of linear algebra subroutines and the Rice Compiler Evaluation Program Suite (RiCEPS), a set of complete application codes from a variety of scientific disciplines. The experimental results demonstrate that regular section analysis is an effective means of discovering parallelism, given programs written in an appropriately modular programming style.>
Cited by 242 works. doi:10.1109/71.86110
Authors
References
- LINPACK Users' Guide
- Abstract interpretation
- LINPACK User's Guide.
- PFC: A Program to Convert Fortran to Parallel Form
- Affine relationships among variables of a program
- Software methods for improvement of cache performance on supercomputer applications
- Interprocedural dependence analysis and parallelization
- Global value numbers and redundant computations
- Compiler Analysis of the Value Ranges for Variables
- Interprocedural constant propagation