What Can We gain by Unfolding Loops?

ACM SIGPLAN Notices

Volumn 39, Issue 2, 2004, Pages 26-33

  Song, Litong ^a   Kavi, Krishna ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

Loop peeling; Loop quasi invariant code motion; Loop unrolling; Quasi index variable; Quasi invariant variable

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; MULTIPROCESSING SYSTEMS; OPTIMIZATION; PROGRAM COMPILERS; SEQUENTIAL CIRCUITS;

LOOP PEELING; LOOP QUASI INVARIANT CODE MOTION; LOOP UNROLLING; QUASI-INDEX VARIABLES; QUASI-INVARIANT VARIABLES;

COMPUTER PROGRAMMING;

EID: 1642385326     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/967278.967284     Document Type: Article

References (27)

1. Aho A. V., Sethi R., Ullman J. D., ìCompilers: Principles, Techniques, and Toolsî, Addison-Wesley, Reading, Mass, 1986.
2. Allen R., Kennedy K., ìOptimization Compilers for Modern Architecturesî, Morgan Kaufmann Publishers, 2002.
3. August D. I., ìHyperblock performance optimizations for ILP processorsî. M.S. thesis, Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, 1996.
4. Bacon D. F., and Graham S. L., ìCompiler transformations for high-performance computingî, ACM Computing Surveys, December 1994, Vol. 26, No. 4, pp.345-420.
5. Banerjee, U., ìAn introduction to a formal theory of dependence analysisî, Journal of Supercomput. Vol. 2, No.2, 1988, pp. 133-149.
6. Bodik R., Gupta R., Soffa M. L., ìComplete removal of redundant expressionsî, Prod. ACM Conf. On Programming Language Design and Implementation, pp. 1-14, ACM Press, 1998.
7. Bulyonkov M. A., Kochetov D. V., ìPractical aspects of specialization of Algol-like programsî, eds. Dancy O., Glueck R., Thiemann P., ìPartial Evaluationî, Proceedings. LNCS, Vol. 1110, pp. 17-32, Springer-Verlag, 1996.
8. nd ed. Courant Institute of Mathematical Science, New York University, New York.
9. Cytron R., Ferrante J., ìEfficiently computing static single assignment form and the control dependence graphî, ACM TOPLAS, October, 1991, Vol. 13, No. 4, pp.451-490.
10. th ACM Symposium on Principle of Programming Languages, pp. 70-85, ACM Press, 1986
11. Dongarra J., Hind A. R., ìUnrolling loops in Fortranî, Softw. Pract. Exper., Vol. 9, No. 3, pp.219-226, 1979.
12. Ellis J. R., ìBuilding: A Compiler for VLIW Architectureî, ACM Doctoral Dissertation Award. MIT Press, Cambridge, Mass, 1986.
13. Floyd R. W., ìAlgorithm 97: shortest pathî, Communications of the ACM, 1962, Vol. 5, No. 6, pp.345.
14. Kavi K. M., Giorgi R. and Arul J., ìScheduled Dataflow: Execution paradigm, architecture and performance evaluationî, IEEE Transactions on Computer, Vol. 50, No. 8, pp.834-846, Aug. 2001.
15. Lin D. C., ìCompiler support for predicated execution in superscalar processorsî, M.S. thesis, Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, 1992.
16. Mahlke S. A., ìExploiting instruction level parallelism in the presence of conditional branchesî, Ph.D. thesis, Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, 1995.
17. Metzger R., Stroud S., ìInterprocedual constant propagation: An empirical studyî, ACM Letters on Programming Languages and Systems, Vol. 2, No. 1, pp.213-232, 1993.
18. Padua D. A., and Wolfe M. J., ìAdvanced compiler optimizations for supercomputersî. Communications of the ACM, December 1986, Vol. 29, No. 12, pp.1184-1201.
19. Pande S., Agrawal D. P., (Eds.) ìCompiler Optimizations for Scalable Parallel Systemsî, LNCS 1808, Springer, 1998.
20. th ACM Symposium on Principles of Programming Languages, ACM Press, 1988, pp. 12-27.
21. Song L., ìStudies on Termination Methods of Partial Evaluationî, Ph.D. thesis, Department of Computer Science, Waseda University, Tokyo, Japan, 2001.
22. Steffen B., ìProperty oriented expansionî, Symposium on Static Analysis, LNCS 1145, pp.22-41, Springer-Verlag, 1996.
23. Steffen B., Knoop J., R,thing O., ìThe value flow graph: A program representation for optimal program transformationsî, ed. Jones N. D., ESOPí90, LNCS 432, pp.389-405, Springer-Verlag, 1990.
24. Warshall S., ìA theorem on Boolean matricesî, Journal of the ACM, January 1962, Vol. 9, No. 1, pp. 11-12.
25. Wolfe, M. J., ìOptimizing supercompilers for supercomputersî, Research Monographs in Parallel and Distributed Computing, MIT Press, Cambridge, Mass.
26. Wolfe, M. J., ìHigh performance compilers for parallel computingî, Addison-Wesley Publishing Company, Inc., 1996.
27. Zima H., and Chapman B., ìSupercompiler for parallel and vector computersî, Frontier, Series, ACM Press, 1990.