Interprocedural dependence analysis and parallelization
Michael Burke, Ron K. Cytron · ACM SIGPLAN Notices · 1986
We present a method that combines a deep analysis of program dependences with a broad analysis of the interaction among procedures. The method is more efficient than existing methods: we reduce many tests, performed separately by existing methods, to a single test. The method is more precise than existing methods with respect to references to multi-dimensional arrays and dependence information hidden by procedure calls. The method is more general than existing methods: we accommodate potentially aliased variables and structures of differing shapes that share storage. We accomplish the above through a unified approach that integrates subscript analysis with aliasing and interprocedural information.
Cited by 69 works. doi:10.1145/13310.13328
Authors
References
- A unified approach to global program optimization
- Optimizing supercompilers for supercomputers
- An efficient way to find the side effects of procedure calls and the aliases of variables
- Deciding Linear Inequalities by Computing Loop Residues
- Constant propagation with conditional branches
- Efficient computation of flow insensitive interprocedural summary information
- Analyzing aliases of reference formal parameters
- Symbolic evaluation and the global value graph
- Interprocedural dependence analysis and parallelization