期刊文献+

多面体模型代码生成算法研究

Code Generation Based on Polyhedra Model
下载PDF
导出
摘要 编译器中的多面体模型优化框架通常会产生复杂的迭代域,从这些迭代域中生成代码的质量直接影响到优化的效果,现有的优化多基于重叠迭代空间分割,然而这种方法难以控制优化层次,容易为无利可图的变换生成体积膨胀的代码,反而会导致指令缓存命中率下降,影响代码的整体运行效率.针对该问题提出一种新的多面体扫描算法,基于严格数学理论对多面体约束条件进行变换,通过消除循环边界计算开销来执行优化,通过控制优化所涉及的嵌套深度以控制代码冗余度,从而可以在不造成代码体积膨胀的情况下进一步提高代码执行效率.通过仿真实验验证了算法的有效性. The quality of the code generated from complex iteration spaces which are created by the loop transformation framework based on polyhedral model is crucial to the effect of the whole optimization work. The state-of-the-art optimizing methods usually use overlapping iteration space splitting technology, but it can hardly control the optimizing level, as a result it may generate inflated codes for some unworthy transformation, which may decrease the hit rate of the instruction cache and slow down the execution of the result codes. This paper presents a new polyhedral scanning algorithm which do transformations to the restrictions of the polyhedra models based on strict math theories. It can generate faster code by eliminating the overhead of loop bounds calculation. It can also avoid the code expansion by limiting the optimization range based on loop nesting depth. We compare with the CodeGen + on three loop nest computations, demonstrating that this algorithm can generate better code as we expect.
出处 《小型微型计算机系统》 CSCD 北大核心 2015年第5期1033-1036,共4页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61203110)资助 上海市教委科研创新项目(14YZ107)资助
关键词 多面体扫描 代码生成 多面体变换 循环优化 编译器 polyhedra scanning code generation polyhedral transformation loop optimization compiler
  • 相关文献

参考文献13

  • 1王正华,陆平静,车永刚.迭代编译优化技术综述[J].计算机工程与应用,2008,44(32):1-5. 被引量:2
  • 2陆平静,车永刚,束尧,王正华.多面体表示技术及在程序性能优化中的应用[J].计算机工程与科学,2008,30(9):137-140. 被引量:3
  • 3Wei Li, Keshav Pingali. A singular loop transformation framework based on non-singular matrices[ J]. International Journal of Parallel Programming, 1994,22 ( 2 ) : 183-205.
  • 4Agustin Fernindez, Jos6M. Llabera, Miguel Valero-Garcfa. Loop transformation using nonumimodular matrices [ J ]. IEEE Transac- tions on Parallel and Distributed Systems, 1995,6( 8 ) :832-840.
  • 5Corinne Ancourt, Francois lrigoin. Scanning polyhedra with DO loops[ J]. ACM SIGPLAN Notices, 1991,26(7 ) :39-50.
  • 6Kelly W, Pugh W, Rosser E. Code generation for multiple mappings [C]. Frontiers'95. Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation, Washington: IEEE Computer Society, 1995:332-343.
  • 7Fabien QuiUer'e, Sanjay Rajopadhye, Doran Wilde. Generation of efficient nested loops from polyhedra[ J ]. International Journal of Parallel Programming,2000,28 (5) :469-498.
  • 8C'edric Bastoul. Code generation in the polyhedral model is easier than you think[ C]. PACT'04. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques. Washington: IEEE Computer Society, 2004 : 7 -16.
  • 9Chun Chen. Polyhedra scanning revisited[ J]. ACM SIGPLAN No- tices,2012,47 (6) :499-508.
  • 10C'edric Bastoul. Efficient code generation for automatic paralleliza- tion and optimization [ C ]. ISPDC'03. Proceedings of the Second International Conference on Parallel and Distributed Computing, Washington : IEEE Computer Society, 2003 : 23-30.

二级参考文献84

  • 1陆平静,车永刚,王正华.基于经验搜索的多级存储层次优化[J].计算机工程与应用,2006,42(34):67-69. 被引量:1
  • 2Knijnenburg P,Kisuki T,Boyle M O.Iterative compilation[C]//LNCS 2268 :Embedded Processor Design Challenges System Architecture, Modeling and Simulation.[S.l.]:Springer Verlag,2002: 171-187.
  • 3Qasem A.Automatic tuning of whole applications using direct search and a performance-based transformation system[C]//Proc LACSI Symposium,Los Alamos Computer Science Institute,NM, USA, 2004.
  • 4Hooke R.Direct search solution of numerical and statistical problems[J].Journal of the ACM, 1961:212-229.
  • 5You H,Seymour K,Dongarra J.An effective empirical search method for automatic software tuning,ICL-UT-05-02[R],UTK CS Technical Report, 2005.
  • 6Vuduc R.Statistical models for empirical search-based performance tuning[J].International Journal of High-Performance Computing Applications, 2004,18( 1 ) : 135-158.
  • 7Kulkarni P A.Fast and efficient searches for effective optimization- phase sequences[J].ACM Transactions on Architecture and Code Optimization, 2005,2(2) : 165-198.
  • 8Chen Chun.A systematic approach to model-guided empirical search for memory hierarchy optimization[C]//Proc 18th International Workshop on Languages and Compilers for Parallel Computing, Hawthorne, New York, 2005.
  • 9Epshteyn A,Garzaran M.Analytic models and empirical search:A hybrid approach to code optimization[C]//Proc 18th International Workshop on Languages and Compilers for Parallel Computing, 2005.
  • 10Cooper K D,Grosul A.ACME:Adaptive compilation made efficient[C]// Proc ACM Conference on Languages,Compilers,and Tools for Embedded Systems, 2005 : 69-77.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部