计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (24): 63-66.DOI: 10.3778/j.issn.1002-8331.2009.24.020

• 研发、设计、测试 • 上一篇    下一篇

数的循环优化序列定制方法

陈 烨1,2   

  1. 1.中国科学院 研究生院,北京 100039
    2.中国科学院 软件研究所 基础软件国家工程研究中心,北京 100190
  • 收稿日期:2009-01-08 修回日期:2009-04-28 出版日期:2009-08-21 发布日期:2009-08-21
  • 通讯作者: 陈 烨

Customized phase-ordering of loop optimizations for routines

CHEN Ye 1,2   

  1. 1.Graduate School,Chinese Academy of Sciences,Beijing 100039,China
    2.National Fundamental Software of China Ltd.,Institute of Software,Chinese Academy of Sciences,Beijing 100190,China
  • Received:2009-01-08 Revised:2009-04-28 Online:2009-08-21 Published:2009-08-21
  • Contact: CHEN Ye

摘要: 讨论了一种可针对程序中的不同函数(routine)采用不同的循环优化序列的方法,该方法基于polyhedron模型,使用简化cache失效率方程分别对每一个函数作优化序列评估,以迭代编译方式为每个函数寻找一个独特的循环优化序列。该方法降低了变换实施的复杂度,降低了对编译器具体实现的依赖;考虑程序中不同函数的差异以获得更好的优化效果。对SPEC2006的实验数据表明,经过定制优化之后,较之Open64-O3,加速比为1.05~1.13。

关键词: polyhedron模型, 优化序列定制, cache失效率, CMES简化方程

Abstract: This paper presents a polyhedron model based approach for automated phase-ordering of loop optimizations for different routines in a program,which can determine a customized sequence to apply loop optimizations for each individual program.It employs a simplified cache miss equation to evaluate each routine’s performance.It is of iterative compilation,and can decrease difficulty of transformation implementation,and decrease dependency on concrete compiler implementation.Experiments for SPEC2006 show that speedup is 1.05~1.13 compared with Open64-O3.

Key words: polyhedron model, phase ordering of loop optimizations, cache miss rate, CMES Equation

中图分类号: