A scalable auto-tuning framework for compiler optimization

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Tiwari, Ananta ^a   Chen, Chun ^b   Chame, Jacqueline ^c   Hall, Mary ^b   Hollingsworth, Jeffrey K ^a  

^a University of Maryland   (United States)

^b University of Utah   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOTUNING; COMPILER OPTIMIZATIONS; COMPILER TRANSFORMATIONS; COMPILER-GENERATED CODES; COMPUTATION KERNEL; PARALLEL A; PARALLEL SEARCH; SEARCH ALGORITHMS;

DISTRIBUTED PARAMETER NETWORKS; LEARNING ALGORITHMS; TUNING;

PROGRAM COMPILERS;

EID: 70449844310     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161054     Document Type: Conference Paper

References (24)

1. F. Agakov, E. Bonilla, J. Cavazos, B. Franke, G. Fursin, M. F. P. O'Boyle, J. Thomson, M. Toussaint, and C. K. I. Williams. Using machine learning to focus iterative optimization. In Proceedings of the International Symposium on Code Generation and Optimization, Mar. 2004.
2. S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Y. Wu. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J. ACM, 45(6):891-923, 1998.
3. J. Bilmes, K. Asanović, C.-W. Chin, and J. Demmel. Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology. In Proceedings of the 1997 ACM International Conference on Supercomputing, June 1997.
4. U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan. A practical automatic polyhedral program optimization system. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), June 2008.
5. C. Chen. Model-Guided Empirical Optimization for Memory Hierarchy. PhD thesis, University of Southern California, 2007.
6. C. Chen, J. Chame, and M. Hall. CHiLL: A framework for composing high-level loop transformations. Technical report, University of Southern California, 2008.
7. C. Chen, J. Chame, and M. W. Hall. Combining models and guided empirical search to optimize for multiple levels of the memory hierarchy. In Proceedings of the International Symposium on Code Generation and Optimization, Mar. 2005.
8. I.-H. Chung and J. K. Hollingsworth. Using information from prior runs to improve automated tuning systems. In SC '04: Proceedings of the 2004 ACM/IEEE conference on Supercomputing, page 30, Washington, DC, USA, 2004. IEEE Computer Society.
9. M. Frigo. A fast Fourier transform compiler. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, May 1999.
10. G. Fursin and A. Cohen. Building a practical iterative compiler. In Workshop on Statistical and Machine Learning Approaches to Architectures and Compilation (SMART'09), Jan. 2007.
11. S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies. International Journal of Parallel Programming, 34(3):261-317, June 2006.
12. W. Kelly, V. Maslov, W. Pugh, E. Rosser, T. Shpeisman, and D. Wonnacott. The Omega Library interface guide. Technical Report CS-TR-3445, University of Maryland at College Park, Mar. 1995.
13. D. Kim, L. Renganarayanan, D. Rostron, S. Rajopadhye, and M. M. Strout. Multi-level tiling: M for the price of one. In SC '07: Proceedings of the 2007 ACM/IEEE conference on Supercomputing, pages 1-12, New York, NY, USA, 2007. ACM.
14. T. Kisuki, P. M. W. Knijnenburg, and M. F. P. O'Boyle. Combined selection of tile sizes and unroll factors using iterative compilation. In PACT '00: Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques, page 237, Washington, DC, USA, 2000. IEEE Computer Society.
15. D. M. Mount. http://www.cs.umd.edu/̃mount/ANN/. [last accessed: Feb 09, 2009].
16. Y. Nelson, B. Bansal, M. Hall, A. Nakano, and K. Lerman. Model-guided performance tuning of parameter values: A case study with molecular dynamics visualization. Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on, pages 1-8, April 2008.
17. L.-N. Pouchet, C. Bastoul, A. Cohen, and J. Cavazos. Iterative optimization in the polyhedral model: Part II, multidimensional time. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'08), pages 90-100, Tucson, Arizona, June 2008. ACM Press.
18. A. Qasem, K. Kennedy, and J. Mellor-Crummey. Automatic tuning of whole applications using direct search and a performance-based transformation system. J. Supercomput., 36(2):183-196, 2006.
19. V. Tabatabaee, A. Tiwari, and J. K. Hollingsworth. Parallel parameter tuning for applications with performance variability. In SC '05: Proceedings of the 2005 ACM/IEEE conference on Supercomputing, page 57, Washington, DC, USA, 2005. IEEE Computer Society.
20. R. Vuduc, J. W. Demmel, and K. A. Yelick. Oski: A library of automatically tuned sparse matrix kernels. Journal of Physics: Conference Series, 16:521-530, June 2005.
21. R. C. Whaley and J. Dongarra. Automatically tuned linear algebra software. In Proceedings of Supercomputing '98, Nov. 1998.
22. J. Xiong, J. Johnson, R. Johnson, and D. Padua. SPL: A language and compiler for DSP algorithms. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2001.
23. Q. Yi, K. Seymour, H. You, R. Vuduc, and D. Quinlan. Poet: Parameterized optimizations for empirical tuning. Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International, pages 1-8, March 2007.
24. K. Yotov, X. Li, G. Ren, M. Garzaran, D. Padua, K. Pingali, and P. Stodghill. Is search really necessary to generate high-performance BLAS? Proceedings of the IEEE: Special Issue on Program Generation, Optimization, and Platform Adaptation, 93(2):358-386, Feb. 2005.