Affiliation:
1. Computer Sciences Corp., El Segundo, CA
Abstract
A method of optimizing the computation of arithmetic and indexing expressions of a Fortran program is presented. The method is based on a linear analysis of the definition points of the variables and the branching and DO loop structure of the program.
The objectives of the processing are (1) to eliminate redundant calculations when references are made to common sub-expression values, (2) to remove invariant calculations from DO loops, (3) to efficiently compute subscripts containing DO iteration variables, and (4) to provide efficient index register usage.
The method presented requires at least a three-pass compiler, the second of which is scanned backward. It has been used in the development of several FORTRAN compilers that have proved to produce excellent object code without significantly reducing the compilation speed.
Publisher
Association for Computing Machinery (ACM)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Array Operators Using Multiple Dispatch;Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming;2014-06-09
2. Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;1996
3. Code Motion;SIAM Journal on Computing;1980-05
4. High-level data flow analysis;Communications of the ACM;1977-10
5. An algorithm for the construction of regions of constant values of variables;Cybernetics;1977