arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.04405cs.PLcs.LG
收藏

利用机器学习进行编译器自动调优的综述

A Survey on Compiler Autotuning using Machine Learning

University of Toronto(多伦多大学);Millersville University of Pennsylvania(宾夕法尼亚米勒斯维尔大学);University of Delaware(特拉华大学);Politecnico di Milano(米兰理工大学)

Amir H. Ashouri, William Killian, John Cavazos, Gianluca Palermo, Cristina Silvano

摘要:

自20世纪90年代中期以来,研究人员一直试图使用基于机器学习的方法来解决许多不同的编译器优化问题。这些技术主要提高了所获得的结果的质量,更重要的是,使得解决两个主要的编译器优化问题变得可行:优化选择(选择应用哪些优化)和阶段排序(选择应用优化的顺序)。由于应用程序的进步、编译器优化数量的增加以及新的目标体系结构,编译器优化空间继续增长。编译器中的泛型优化传递不能完全利用新引入的优化,因此,不能跟上增加选项的步伐。本综述总结并分类了在编译器优化领域使用机器学习的最新进展,特别是在(1)选择最佳优化和(2)优化的阶段排序这两个主要问题上。该调查突出了迄今为止所采取的方法,所获得的结果,不同方法之间的细粒度分类,最后,该领域的有影响力的论文。

英文摘要:

Since the mid-1990s, researchers have been trying to use machine-learning based approaches to solve a number of different compiler optimization problems. These techniques primarily enhance the quality of the obtained results and, more importantly, make it feasible to tackle two main compiler optimization problems: optimization selection (choosing which optimizations to apply) and phase-ordering (choosing the order of applying optimizations). The compiler optimization space continues to grow due to the advancement of applications, increasing number of compiler optimizations, and new target architectures. Generic optimization passes in compilers cannot fully leverage newly introduced optimizations and, therefore, cannot keep up with the pace of increasing options. This survey summarizes and classifies the recent advances in using machine learning for the compiler optimization field, particularly on the two major problems of (1) selecting the best optimizations and (2) the phase-ordering of optimizations. The survey highlights the approaches taken so far, the obtained results, the fine-grain classification among different approaches and finally, the influential papers of the field.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑