Meta optimization: Improving compiler heuristics with machine learning

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

Volumn , Issue , 2003, Pages 77-90

  Stephenson, Mark ^a   Amarasinghe, Saman ^a   Martin, Martin ^a   O'Reilly, Una May ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Compiler Heuristics; Genetic Programming; Machine Learning; Priority Functions

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LEARNING SYSTEMS; OPTIMIZATION; RESOURCE ALLOCATION;

META OPTIMIZATION;

PROGRAM COMPILERS;

EID: 0038035143     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. S. G. Abraham, V. Kathail, and B. L. Deitrich. Meld Scheduling: Relaxing Scheduling Constaints Across Region Boundaries. In Proceedings of the 29th Annual International Symposium on Microarchitecture (MICRO-29), pages 308-321, 1996.
2. W. Banzhaf, P. Nordin, R. Keller, and F. Francone. Genetic Programming: An Introduction: On the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann, 1998.
3. D. Bernstein, D. Goldin, and M. G. et. al. Spill Code Minimization Techniques for Optimizing Compilers. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 258-263, 1989.
4. D. Bourgin. Losslessy compression schemes. http://hpux.u-aizu.ac.jp/hppd/hpux/Languages/codecs-1.0/.
5. B. Calder, D. G. ad Michael Jones, D. Lindsay, J. Martin, M. Mozer, and B. Zorn. Evidence-Based Static Branch Prediction Using Machine Learning. In ACM Transactions on Programming Languages and Systems (ToPLaS-19), volume 19, 1997.
6. P. Chang, D. Lavery, S. Mahlke, W. Chen, and W. Hwu. The Importance of Prepass Code Scheduling for Superscalar and Superpipelined processors. In IEEE Transactions on Computers, volume 44, pages 353-370, March 1995.
7. F. C. Chow and J. L. Hennessey. The Priority-Based Coloring Approch to Register Allocation. In ACM Transactions on Programming Languages and Systems (ToPLaS-12), pages 501-536, 1990.
8. K. Cooper, P. Scheilke, and D. Subramanian. Optimizing for Reduced Code Space using Genetic Algorithms. In Languages, Compilers, Tools for Embedded Systems, pages 1-9, 1999.
9. C. Gathercole. An Investigation of Supervised Learning in Genetic Programming. PhD thesis, University of Edinburgh, 1998.
10. P. B. Gibbons and S. S. Muchnick. Efficient Instruction Scheduling for a Pipelined Architecture. In Proceedings of the ACM Symposium on Compiler Construction, volume 21, pages 11-16, 1986.
11. G. W. Grewal and C. T. Wilson. Mappping Reference Code to Irregular DSPs with the Retargetable, Optimizing Compiler COGEN (T). In International Symposium on Microarchitecture, volume 34, pages 192-202, 2001
12. M. Kessler and T. Haynes. Depth-Fair Crossover in Genetic Programming. In Proceedings of the ACM Symposium on Applied Computing, pages 319-323, February 1999.
13. J. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. The MT Press, 1992.
14. C. Lee, M. Potkonjak, and W. H. Mangione-Smith. MediaBench: a tool for evaluating and synthesizing multimedia and communication systems. In International Symposium on Microarchitecture, volume 30, pages 330-335, 1997.
15. S. A. Mahlke. Exploiting instruction level parallelism in the presence of branches. PhD thesis, University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, 1996.
16. S. A. Mahlke, D. Lin, W. Chen, R. Hank, and R. Bringmann. Effective Compiler Support for Predicated Execution Using the Hyperblock. In International Symposium on Microarchitecture, volume 25, pages 45-54, 1992.
17. A. Monsifrot, F. Bodin, and R. Quiniou. A Machine Learning Approach to Automatic Production of Compiler Heuristics. In Artificial Intelligence: Methodology, Systems, Applications, pages 41-50, 2002.
18. T. C. Mowry. Tolerating Latency through Software-Controlled Data Prefetching. PhD thesis, Stanford University, Department of Electrical Engineering, 1994
19. Open Research Compiler. http://ipf-orc.sourceforge.net.
20. E. Ozer, S. Banerjia, and T. Conte. Unified Assign and Schedule: A New Approach to Scheduling for Clustered Register Filee Microarchitectures. In Proceedings of the 27th Annual International Symposium on Microarchitecture (MICRO-24), pages 308-315, 1998.
21. J. C. H. Park and M. S. Schlansker. On Predicated Execution. Technical Report HPL-91-58, Hewlett Packard Laboratories, 1991.
22. B. R. Rau. Iterative Modulo Scheduling: An Algorithm for Software Pipelining Loops. In Proceedings of the 27th Annual International Symposium on Microarchitecture (MICRO-24), November 1994.
23. M. Stephenson, S. Amarasinghe, U.-M. O'Reilly, and M. Martin. Compiler Heuristic Design with Machine Learning. Technical Report TR-893, Massachusetts Institute of Technology, 2003.
24. Trimaran, http://www.trimaran.org.
25. N. Warter. Modulo Scheduling with Isomorphic Control Transformations. PhD thesis, University of Illinois at Urbana-Champaign, Department of Electrical and Computer Engineering, 1993.