Optimization of expressions in Fortran

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimization of expressions in Fortran

Full text

Pdf (1.19 MB)

Source

Communications of the ACM archive
Volume 12 , Issue 12 (December 1969) table of contents

Pages: 666 - 674

Year of Publication: 1969

ISSN:0001-0782

Authors

Vincent A. Busam	Computer Sciences Corp., El Segundo, CA
Donald E. Englund	Computer Sciences Corp., El Segundo, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 25, Citation Count: 15

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363626.363635 What is a DOI?

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	C. W. Gear, High speed compilation of efficient object code, Communications of the ACM, v.8 n.8, p.483-488, Aug. 1965 [doi>10.1145/365474.365489]
	2	Ikuo Nakata, On compiling algorithms for arithmetic expressions, Communications of the ACM, v.10 n.8, p.492-494, Aug. 1967 [doi>10.1145/363534.363549]
	3	J. Nievergelt, On the automatic simplification of computer programs, Communications of the ACM, v.8 n.6, p.366-370, June 1965 [doi>10.1145/364955.364963]
	4	RYAN, J. T. A direction-independent algorithm for determining the forward and backward compute point for a term or subscript during compilation. Comput. J. 9, 2 (Aug. 1966), 157-160.
	5	Edward S. Lowry , C. W. Medlock, Object code optimization, Communications of the ACM, v.12 n.1, p.13-22, Jan. 1969 [doi>10.1145/362835.362838]

CITED BY 15

	Will Gillett, An interactive program advising system, ACM SIGCSE Bulletin, v.8 n.1, p.335-341, February 1976
	John T. Bagwell, Jr., Local optimizations, ACM SIGPLAN Notices, v.5 n.7, p.52-66, July 1970
	A. V. Aho , J. D. Ullman, Transformations on straight line programs - (Preliminary Version), Proceedings of the second annual ACM symposium on Theory of computing, p.136-148, May 04-06, 1970, Northampton, Massachusetts, United States
	Paul B. Schneck, A survey of compiler optimization techniques, Proceedings of the annual conference, p.106-113, August 27-29, 1973, Atlanta, Georgia, United States
	R. A. Freiburghouse, Register allocation via usage counts, Communications of the ACM, v.17 n.11, p.638-642, Nov. 1974
	Frances E. Allen, Control flow analysis, ACM SIGPLAN Notices, v.5 n.7, p.1-19, July 1970
	Barry K. Rosen, High-level data flow analysis, Communications of the ACM, v.20 n.10, p.712-724, Oct. 1977
	P. D. Pearce , R. J. Hicks, The optimization of user programs for an Algebraic Manipulation System, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.131-136, August 05-07, 1981, Snowbird, Utah, United States
	Ravi Sethi, Complete register allocation problems, Proceedings of the fifth annual ACM symposium on Theory of computing, p.182-195, April 30-May 02, 1973, Austin, Texas, United States
	B. Press, Meta-optimizer development, ACM SIGPLAN Notices, v.8 n.6, June 1973
	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts
	Christopher Earnest, Some Topics in Code Optimization, Journal of the ACM (JACM), v.21 n.1, p.76-102, Jan. 1974
	Dennis J. Frailey, Expression optimization using unary complement operators, ACM SIGPLAN Notices, v.5 n.7, p.67-85, July 1970
	Alfred V. Aho , Ravi Sethi , J. D. Ullman, A formal approach to code optimization, ACM SIGPLAN Notices, v.5 n.7, p.86-100, July 1970
	A. Hassitt , L. E. Lyon, Efficient evaluation of array subscripts of arrays, IBM Journal of Research and Development, v.16 n.1, p.45-57, January 1972