Interprocedural dependence analysis and parallelization

作者: Michael G. Burke , Ron K. Cytron

DOI: 10.1145/989393.989411

关键词:

摘要: We present a method that combines deep analysis of program dependences with broad the interaction among procedures. The is more efficient than existing methods: we reduce many tests, performed separately by methods, to single test. precise methods respect references multi-dimensional arrays and dependence information hidden procedure calls. general accommodate potentially aliased variables structures differing shapes share storage. accomplish above through unified approach integrates subscript aliasing interprocedural information.

参考文章(17)
Michael G. Burke, Ron Cytron, Interprocedural dependence analysis and parallelization (with retrospective) Best of PLDI. pp. 139- 154 ,(1986)
Keith Daniel Cooper, Interprocedural data flow analysis in a programming environment Rice University. ,(1983)
John P. Banning, An efficient way to find the side effects of procedure calls and the aliases of variables symposium on principles of programming languages. pp. 29- 41 ,(1979) , 10.1145/567752.567756
Keith D. Cooper, Ken Kennedy, Efficient computation of flow insensitive interprocedural summary information Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84. ,vol. 19, pp. 247- 258 ,(1984) , 10.1145/502874.502898
John H. Reif, Harry R. Lewis, Symbolic evaluation and the global value graph Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '77. pp. 104- 118 ,(1977) , 10.1145/512950.512961
Mark N. Wegman, Frank Kenneth Zadeck, Constant propagation with conditional branches symposium on principles of programming languages. pp. 291- 299 ,(1985) , 10.1145/318593.318659
Robert Shostak, Deciding Linear Inequalities by Computing Loop Residues Journal of the ACM. ,vol. 28, pp. 769- 779 ,(1981) , 10.1145/322276.322288