OpenTuner: An Extensible Framework for Program Autotuning

被引:365
作者
Ansel, Jason [1 ]
Kamil, Shoaib [1 ]
Veeramachaneni, Kalyan [1 ]
Ragan-Kelley, Jonathan [1 ]
Bosboom, Jeffrey [1 ]
O'Reilly, Una-May [1 ]
Amarasinghe, Saman [1 ]
机构
[1] MIT, 77 Massachusetts Ave, Cambridge, MA 02139 USA
来源
PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES (PACT'14) | 2014年
关键词
D O I
10.1145/2628071.2628092
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Program autotuning has been shown to achieve better or more portable performance in a number of domains. However, autotuners themselves are rarely portable between projects, for a number of reasons: using a domain-informed search space representation is critical to achieving good results; search spaces can be intractably large and require advanced machine learning techniques; and the landscape of search spaces can vary greatly between different problems, sometimes requiring domain specific search techniques to explore efficiently. This paper introduces OpenTuner, a new open source framework for building domain-specific multi-objective program autotuners. OpenTuner supports fully-customizable configuration representations, an extensible technique representation to allow for domain-specific techniques, and an easy to use interface for communicating with the program to be autotuned. A key capability inside OpenTuner is the use of ensembles of disparate search techniques simultaneously; techniques that perform well will dynamically be allocated a larger proportion of tests. We demonstrate the efficacy and generality of OpenTuner by building autotuners for 7 distinct projects and 16 total benchmarks, showing speedups over prior techniques of these projects of up to 2.8x with little programmer effort.
引用
收藏
页码:303 / 315
页数:13
相关论文
共 35 条
[1]  
Agakov F, 2006, INT SYM CODE GENER, P295
[2]   Finding effective compilation sequences [J].
Almagor, L ;
Cooper, KD ;
Grosul, A ;
Harvey, TJ ;
Reeves, SW ;
Subramanian, D ;
Torczon, L ;
Waterman, T .
ACM SIGPLAN NOTICES, 2004, 39 (07) :231-239
[3]  
[Anonymous], 2010, 2010 IEEE INT S PAR
[4]  
[Anonymous], ASPLOS
[5]  
[Anonymous], P GCC DEV SUMM JUL
[6]  
[Anonymous], ANN C GEN EV COMP DU
[7]  
[Anonymous], 2009, PLDI
[8]  
Baek W., 2010, PLDI
[9]  
Bhat V., 2006, INT C AUT COMP WASH
[10]  
Chan C., 2009, SUPERCOMPUTING