arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.01112cs.DC
收藏

基于增广拓扑神经进化的IF转换优化

If-Conversion Optimization using Neuro Evolution of Augmenting Topologies

Reem Elkhouly, Keiji Kimura, Ahmed El-Mahdy

摘要:

控制流依赖性是程序加速的内在限制因素。随着并行级并行体系结构的出现,如果转换优化已经成为从串行程序中提取并行性的关键。虽然文献中已经提出了许多if转换优化算法,但大多数算法都考虑了严格的标准,而不管底层硬件和输入程序。在本文中,我们提出了一种新的if转换方案,使用机器学习技术(NEAT)进行有效的if转换变换。这种方法使if-conversion自定义的整体分支在一个程序中,不像文献中考虑的个别分支。我们的技术还提供了异构系统编译时所需的灵活性。实验和报告的结果表明,我们的方法的有效性,说明程序可以加速相同的架构,而不修改原始代码。我们的技术适用于通用程序设计语言(如C/C++),是透明的程序员。我们在LLVM 3.6.1编译基础设施中实现了我们的技术,并在运行于英特尔(R)至强(R)3.50 GHz处理器的多核系统上的SPEC-CPU 2006 v1.1基准测试套件的内核上进行了实验。我们的研究结果显示,与标准优化代码(LLVM -O2,包括if转换)相比,性能提高了8.6%,表明需要进行If转换编译优化,以适应每个分支的独特特性。

英文摘要:

Control-flow dependence is an intrinsic limiting factor for pro- gram acceleration. With the availability of instruction-level par- allel architectures, if-conversion optimization has, therefore, be- come pivotal for extracting parallelism from serial programs. While many if-conversion optimization heuristics have been proposed in the literature, most of them consider rigid criteria regardless of the underlying hardware and input programs. In this paper, we propose a novel if-conversion scheme that preforms an efficient if-conversion transformation using a machine learning technique (NEAT). This method enables if-conversion customization overall branches within a program unlike the literature that considered in- dividual branches. Our technique also provides flexibility required when compiling for heterogeneous systems. The efficacy of our approach is shown by experiments and reported results which il- lustrate that the programs can be accelerated on the same archi- tecture and without modifying the original code. Our technique applies for general purpose programming languages (e.g. C/C++) and is transparent for the programmer. We implemented our tech- nique in LLVM 3.6.1 compilation infrastructure and experimented on the kernels of SPEC-CPU2006 v1.1 benchmarks suite running on a multicore system of Intel(R) Xeon(R) 3.50GHz processors. Our findings show a performance gain up to 8.6% over the stan- dard optimized code (LLVM -O2 with if-conversion included), in- dicating the need for If-conversion compilation optimization that can adapt to the unique characteristics of every individual branch.

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

↑