Thumbnail
Access Restriction
Subscribed

Author Scheifler, Robert W.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Run-time statistics ♦ Program optimization ♦ Open compilation ♦ Open coding ♦ Inline substitution ♦ Structured programming languages ♦ Compilers
Abstract An optimization technique known as inline substitution is analyzed. The optimization consists of replacing a procedure invocation by a modified copy of the procedure body. The general problem of using inline substitution to minimize execution time subject to size constraints is formulated, and an approximate algorithmic solution is proposed. The algorithm depends on run-time statistics about the program to be optimized. Preliminary results for the CLU structured programming language indicate that, in programs with a low degree of recursion, over 90 percent of all procedure calls can be eliminated, with little increase in the size of compiled code and a small savings in execution time. Other conclusions based on these results are also presented.
Description Affiliation: Massachusetts Institute of Technology, Cambridge (Scheifler, Robert W.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 20
Issue Number 9
Page Count 8
Starting Page 647
Ending Page 654


Open content in new tab

   Open content in new tab
Source: ACM Digital Library