A framework for unrestricted whole-program optimization

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 2006, Issue , 2006, Pages 61-71

  Triantafyllis, Spyridon ^a   Bridges, Matthew J ^a   Raman, Easwaran ^a   Ottoni, Guilherme ^a   August, David I ^a  

^a Princeton University   (United States)

Author keywords

Inlining; Interprocedural analysis; Interprocedural optimization; Path sensitive analysis; Procedure unification; Region encapsulation; Region formation; Region based compilation; Specialization; Superblock; Whole program analysis; Whole program optimization

Indexed keywords

INTERPROCEDURAL ANALYSIS; INTERPROCEDURAL OPTIMIZATION; PROCEDURE UNIFICATION; REGION ENCAPSULATION; REGION FORMATION; REGION-BASED COMPILATION; SPECIALIZATION; SUPERBLOCK; WHOLE-PROGRAM ANALYSIS; WHOLE-PROGRAM OPTIMIZATION;

CODES (SYMBOLS); GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SOFTWARE ENGINEERING;

COMPUTER PROGRAM LISTINGS;

EID: 33746072606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133255.1133989     Document Type: Conference Paper

References (21)

1. AUGUST, D. I., CONNORS, D. A., MAHLKE, S. A., SIAS, J. W., CROZIER, K. M., CHENG, B., EATON, P. R., OLANIKAN, Q. B., AND HWU, W. W. Integrated predication and speculative execution in the IMPACT EPIC architecture. In Proceedings of the 25th International Symposium on Computer Architecture (June 1998), pp. 227-237.
2. AYERS, A., SCHOOLER, R., AND GOTTLIEB, R. Aggressive inlining. In ACM SIGPLAN '97 Conference on Programming Language Design and Implementation (June 1997), pp. 134-145.
3. BODIK, R., GUPTA, R., AND SOFFA, M. L. Complete removal of redundant computation. In Proceedings of the ACM SIGPLAN 1998 Conference on Programming Language Design and Implementation (June 1998), pp. 1-14.
4. CALLAHAN, D., COOPER, K. D., KENNEDY, K., AND TORCZON, L. Interprocedural constant propagation. In Proceedings of the ACM SIGPLAN'86 Symposium on Compiler Construction (July 1986), pp. 152-161.
5. CHANG, P. P., MAHLKE, S. A., CHEN, W. Y., AND HWU, W. W. Profile-guided automatic inline expansion for C programs. Software Practice and Experience 22, 5 (May 1992), 349-370.
6. EICHENBERGER, A., MELEIS, W., AND MARADANI, S. An integrated approach to accelerate data and predicate computations in hyperblocks. In Proceedings of the 33rd Annual ACM/IEEE International Symposium on Microarchitecture (November 2000), pp. 101-111.
7. ERANIAN, S. Perfmon: Linux performance monitoring for 1A-64. http://www.hpl.hp.com/research/linux/perfmon/, 2003.
8. GOUBAULT, J. Generalized boxings, congruences and partial inlining. In first International Static Analysis Symposium (Namur, Belgium, September 1994).
9. HANK, R. E., HWU, W. W., AND RAU, B. R. Region-based compilation: An introduction and motivation. In Proceedings of the 28th Annual International Symposium on Microarchitecture (December 1995), pp. 158-168.
10. HAVANKI, W. A. Treegion scheduling for VLIW processors. Master's thesis. Department of Computer Science, North Carolina State University, 1997.
11. HWU, W. W., AND CHANO, P. P. Inline function expansion for compiling realistic C programs. In Proceedings of the ACM SIGPLAN 1989 Conference on Programming Language Design and Implementation (June 1989), pp. 246-257.
12. HWU, W. W., MAHLKE, S. A., CHEN, W. Y., CHANG, P. P., WARTER, N. J., BRINOMANN, R. A., OUELLETTE, R. G., HANK, R. E., KIYOHARA, T., HAAB, G. E., HOLM, J. G., AND LAVERY, D. M. The superblock: An effective technique for VL1W and superscalar compilation. The Journal of Supercomputig 7, 1 (January 1993), 229-248.
13. KNOOP, J., AND STEFFEN, B. The interprocedural coincidence theorem. In Proceedings of the 4th International Conference on Compiler Construction (Paderborn, Germany, October 1992), pp. 125-140.
14. MAHLKE, S. A., LIN, D. C., CHEN, W. V., HANK, R. E., BRINOMANN, R. A., AND HWU, W. W. Effective compiler support for predicated execution using the hyperblock. In Proceedings of the 25th International Symposium on Microarchitecture (December 1992), pp. 45-54.
15. MYERS, E. W. A precise inter-procedural data flow algorithm. In Proceedings of the 8th ACM symposium on Principles of programming languages (Jan. 1981), pp. 219-230.
16. NYSTROM, E. M., KIM, H.-S., AND HWU, W.-M. Bottom-up and top-down context-sensitive summary-based pointer analysis. In Proceedings of the 11th Static Analysis Symposium (August 2004).
17. REPS, T., HORWITZ, S., AND SAGIV, M. Precise interprocedural dataflow analysis via graph reachability. In Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (June 1995), pp. 49-61.
18. SANTHANAM, V., AND ODNERT, D. Register allocation across procedure and module boundaries. In Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation (June 1990), pp. 28-39.
19. SHARIR, M., AND PNUELI, A. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, Eds. Prentice-Hall, Englewood Cliffs, NJ, 1981, pp. 189-233.
20. SUGANUMA, T., YASUE, T., AND NAKATANI, T. A region-based compilation technique for a Java just-in-time compiler. In Proceedings of the ACM SIGPLAN 2003 conference on Programming Language Design and Implementation (June 2003), pp. 312-323.
21. WAY, T., BREECH, B., AND POLLOCK, L. Region formation analysis with demand-driven inlining for region-based optimization. In Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques (May 2000), p. 24.