Program optimization - theory and practice
暂无分享,去创建一个
The conventional program optimization techniques employed by the ILLIAC FORTRAN compiler are general purpose, effective, and efficient. The underlying theory is applicable to FORTRAN and to other high level languages. A unique approach to the gathering of global set and use information about variables as well as careful software engineering of the algorithms has led to the construction of an effective source-to-source optimizer which performs constant propagation, constant computation, common subexpression elimination, reduction in strength, and invariant code motion. We will first consider the type of information which must be gathered about a program, and how this information is used to perform optimization. Then we shall state the algorithm for globally computing the set and use information for program variables. Having discussed the science of optimization we shall turn to the engineering aspects and consider such topics as representation of programs, order of optimization transformations, and efficient computation of global use and set information.
[1] Robert M. Shapiro,et al. THE REPRESENTATION OF ALGORITHMS , 1969 .
[2] C. P. Earnest,et al. Analysis of Graphs by Ordering of Nodes , 1972, JACM.
[3] D. W. Barron. A Mathematical Theory of Global Program Optimization , 1974 .
[4] P. Abrahams,et al. A mathematical theory of global program optimization , 1975 .
[5] Ben Wegbreit,et al. Property extraction in well-founded property sets , 1975, IEEE Transactions on Software Engineering.