ACME: Adaptive compilation made efficient

ACM SIGPLAN Notices

Volumn 40, Issue 7, 2005, Pages 69-77

  Cooper, Keith D ^a   Grosul, Alexander ^a   Harvey, Timothy J ^a   Reeves, Steven ^a   Subramanian, Devika ^a   Torczon, Linda ^a   Waterman, Todd ^a  

^a Rice University   (United States)

Author keywords

Adaptive compilation

Indexed keywords

ADAPTIVE COMPILATION; FEEDBACK-DRIVEN ADAPTIVE SYSTEM; FINE-GRAINED CONTROL; VIRTUAL EXECUTION;

CODES (SYMBOLS); FEEDBACK; GRAPHICAL USER INTERFACES; OPTIMIZATION; PARAMETER ESTIMATION; PROGRAM COMPILERS; VIRTUAL REALITY;

ADAPTIVE SYSTEMS;

EID: 33745197132     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1070891.1065921     Document Type: Article

References (28)

1. L. Almagor, Keith D. Cooper, Alexander Grosul, Timothy J. Harvey, Steven W. Reeves, Devika Subramanian, Linda Torczon, and Todd Waterman. Finding effective compilation sequences. In Proceedings of LCTES 2004, pages 231-239, June 2004.
2. th POPL, pages 1-11, San Diego, CA, USA, January 1988.
3. Thomas Ball and James R. Larus. Optimally profiling and tracing programs. In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Programming Languages, pages 59-70, January 1992.
4. Preston Briggs. The Massively Scalar Compiler Project. Appendix B of a nuweb document that forms part of the MSCP infrastructure. Available online as www.cs.rice.edu/~keith/EAC/iloc.pdf., July 1994.
5. Preston Briggs and Keith D. Cooper. Effective partial redundancy elimination. In Proceedings of ACM SIGPLAN 94 PLDI, pages 159-170, June 1994.
6. Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via graph coloring. Computer Languages, 6(1):47-57, January 1981.
7. Keith D. Cooper, Alexander Grosul, Timothy J. Harvey, Steve Reeves, Devika Subramanian, Linda Torczon, and Todd Waterman. Searching for compilation sequences. 2005. Submitted for publication.
8. Keith D. Cooper, Philip J. Schielke, and Devika Subramanian. Optimizing for reduced code space using genetic algorithms. In Proceedings of LCTES 1999, pages 1-9, May 1999.
9. st century. In Proceedings of the 2001 LACSI Symposium. Los Alamos Computer Science Institute, Santa Fe, NM, October 2001.
10. Keith D. Cooper and Linda Torczon. Engineering a Compiler. Morgan-Kaufmann Publishers, 2003.
11. Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM TOPLAS, 13(4):451-490, October 1991.
12. Jack W. Davidson and Christopher W. Fraser. The design and application of a retargetable peephole optimizer. ACM TOPLAS, 2(2):191-202, April 1980.
13. Susan L. Graham, Peter B. Kessler, and Marshall K. McKusick. gprof: a call graph execution profiler. In Proceedings of the 1982 SIGPLAN Symposium, on Compiler Constrion, pages 120-126, June 1982.
14. Elana Granston and Anne Holler. Automatic recommendation of compiler options. In Proceedings of the 4th Feedback Directed Optimization Workshop, December 2001.
15. Alexander Grosul. Adaptive Ordering of Code Transformations in an Optimizing Compiler. PhD thesis, Rice University, 2005.
16. Jin-Kao Hao, Frédéric Lardeux, and Frédéric Saubion. A hybrid genetic algorithm for the satisfiability problem. In Proceedings of the First International Workshop on Heuristics, Beijing, China, July 2002.
17. Toru Kisuki, Peter M.W. Knijnenburg, and Michael F.P. O'Boyle. Combined selection of tile sizes and unroll factors using iterative compilation. In Proceedings of PACT '00, pages 237-248, October 2000.
18. Jens Knoop, Oliver Rüthing, and Bernhard Steffen. Lazy code motion. In Proceedings of the ACM SIGPLAN 92 PLDI, pages 224-234, July 1992.
19. Prasad Kulkarni, Stephen Hines, Jason Hiser, David Whalley, Jack Davidson, and Douglas Jones. Searches for effective optimization phase sequences. In Proceedings of ACM SIGPLAN 2004 PLDI, pages 171-182, May 2004.
20. Prasad Kulkarni, Wankang Zhao, Hwashin Moon, Kyunghwan Cho, David Whaley, Jack Davidson, Mark Bailey, Yunheung Paek, and Kyle Gallivan. Finding effective optimization phase sequences. In Proceedings of the 2003 ACM SIGPLAN Conference on Languages, Tools, and Compilers for Embedded Systems, pages 12-23, June 2003.
21. Kathryn S. McKinley, Steve Carr, and Chau-Wen Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems (TOPLAS), 18(4):424-453, July 1996.
22. Etienne Morel and Claude Renvoise. Global optimization by suppression of partial redundancies. Communications of the ACM, 22(2):96-103, February 1979.
23. L. Taylor Simpson. Value-Driven Redundancy Elimination. PhD thesis, Rice University, 1996.
24. Mark Stephenson, Saman Amarasinghe, Martin Martin, and Una-May O'Reilly. Meta optimization: improving compiler heuristics with machine learning. In Proceedings of the ACM SIGPLAN 2003 PLDI, pages 77-90, May 2003.
25. st CGO, March 2003.
26. Mark Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. ACM TOPLAS, 13(2):181-210, April 1991.
27. Deborah L. Whitfield and Mary Lou Soffa. An approach for exploring code improving transformations. ACM TOPLAS, 19(6):1053-1084, November 1997.
28. M. Zhao, B. Childers, and M.L. Soffa. Predicting the impact of optimizations for embedded systems. In Proceedings of LCTES 2003, pages 1-11, June 2003.