Skip to main content
Log in

Inner loops in flowgraphs and code optimization

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A criterion is developed to define a hierarchy of inner loops in a program which constitute sections of the program which take up large proportions of the execution time; this hierarchy lends a dynamic loop structure to the program. It is assumed that the program has been given a flowgraph representation in which each vertex corresponds to a statement or a set of statements and the flow in each edge corresponds to the frequency of passage of control from one statement or set of statements to another. While developing this criterion an attempt is made to guarantee that moving a loop invariant statement from an inner loop to a point outside of the loop would always yield a more optimal code.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allen, F.E.: Program optimization. Annual Review in Automatic Programming 5, pp. 239–307 (1969)

    Google Scholar 

  2. Allen, F.E., Cocke, J.: A catalogue of optimizing transformations. In: Design and optimization of compilers (R. Rustin, ed.), Prentice-Hall (1972)

  3. Aho, A.V., Ulman, J.D.: Principles of compiler design. Addison Wesley (1978)

  4. Ingalls, D.: FETE, a FORTRAN execution time estimator. In: Program style, design, efficiency, debugging and testing. Prentice Hall (1974)

  5. Ingalls, D.: The execution time profile as a programming tool. In: Design and optimization of compilers (R. Rustin, ed.) Prentice-Hall (1972)

  6. Knuth, D.E.: An empirical study of FORTRAN programs. Software practice and experience 1, 2, pp. 105–133 (1971)

    Google Scholar 

  7. Mont-Reynaud, B.: Hierarchical properties of flows and the determination of inner loops. Technical Report STAN-CS-77-644, Computer Science Department, Stanford University, Stanford, CA, USA (Ph. D. Thesis, December 1977)

    Google Scholar 

  8. Vasudevan, S.: Determination of the inner loops in flowgraphs — A New Criterion. Disertation report. Department of EECS, University of California, Berkley, USA

  9. Venkataraman, K.N.: Some graph theoretical algorithms. Disertation report, Computer Centre, Indian Institute of Technology, Madras, India (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vasudevan, S. Inner loops in flowgraphs and code optimization. Acta Informatica 17, 143–155 (1982). https://doi.org/10.1007/BF00288967

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288967

Keywords

Navigation