期刊文献+

基于多面体模型的编译“黑魔法” 被引量:9

“Black Magic” of Polyhedral Compilation
下载PDF
导出
摘要 基于多面体模型的编译技术发展近30年,已经在多个开源编译器和商业编译器中得到了应用和实现.与传统的编译优化模型相比,多面体模型具备应用范围广、表示能力强、优化空间大等优点,代表了程序自动并行化领域众多方向最先进的水平,成为国际上多个编译研发团队的研究热点;同时,多面体模型抽象程度高、实现难度大、面临问题多的特征,阻碍了基于该模型的编译技术在发展相对滞后地区的普及,形成国内专门从事该问题研究的团队屈指可数的现象.为了打开多面体模型的"黑盒子",首先描述了多面体模型的原理,揭示了基于多面体模型的编译流程,并指出了该领域的主要研究内容;接下来,从程序并行性、数据局部性和其他领域上的扩展应用这3个方面对该领域上的研究进展进行了介绍;最后,对该研究领域当前面临的挑战和潜在的研究方向进行了总结.研究目的是通过回顾和总结基于多面体模型的编译技术研究进展,为国内编译研发团队提供重要参考,以期推动我国在该领域上的发展. Polyhedral compilation has evolved for nearly three decades, being implemented as a building block or an optional extension of numerous open-source and/or commercial compilers. On the one hand, the polyhedral model is equipped with wider range of applications, more powerful expressiveness and greater optimization space when compared with those traditional models adopted for parallelizing compilers, thus representing the state of the art of almost each domain of parallelizing compilers and becoming a hot topic to a great number of international research teams working on compilers. On the other hand, the polyhedral model is also characterized as being difficult in theory, complex for manipulation, and diverse with challenges, hampering its adoption in underdeveloped countries and areas and drawing few researchers working on this topic from the domestic compiler community, Aiming at opening the "black-box" of the polyhedral model, this paper conducts a survey on the "black magic" of polyhedral compilation. First, the underlaying theory behind the polyhedral model is introduced along with a desciption of the general compilation process and an overview of the research directions. Next, the research progress of the polyhedral compilation targeting on parallelism, data locality, and extensions in various application domains is presented. Last but not least, open challenges faced by the polyhedral community and potential research directions on this topic are disussed. The purpose of this work is to provide an important reference for the domestic compiler community by reviewing and summarizing current trends on the polyhedral compilation, and to promote Chinese compiler researchers in making progress on this topic.
作者 赵捷 李颖颖 赵荣彩 ZHAO Jie;LI Ying-Ying;ZHAO Rong-Cai(PLA Information Engineering University,Zhengzhou 450001,China;Departement d'Informatique,Ecole Normale Superieure,Paris 75005,France;State Key Laboratory of Mathematical Engineering and Advanced Computing(PLA Information Engineering University),Zhengzhou 450001,China;Zhongyuan University of Technology,Zhengzhou 450007,China)
出处 《软件学报》 EI CSCD 北大核心 2018年第8期2371-2396,共26页 Journal of Software
基金 国家自然科学基金(61702546)
关键词 多面体模型 并行性 局部性 依赖 调度 代码生成 循环分块 数组压缩 polyhedral model parallelism locality dependence schedule code generation loop tiling array contraction
  • 相关文献

参考文献2

二级参考文献58

  • 1Cousot P, Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proc. of the 4th POPL. New York: ACM Press, 1977.238-252.
  • 2Cousot P. The verification grand challenge and abstract interpretation. In: Meyer B, Woodcock J, eds. Verified Software: Tools, Theories, Experiments (VSTTE 2005). LNCS 417 1, Berlin: Springer-Verlag, 2008. 189-201.
  • 3Min6 A. Weakly relational numerical abstract domains [Ph.D. Thesis]. Paris: Ecole Normale Superieure, 2004.
  • 4Li MJ, Li ZJ, Chen HW. Program verification techniques based on the abstract interpretation theory. Journal of Software, 2008, 19(1):17-26 (in Chinese with English abstract), http://www.jos.org.cn/1000-9825/19/17.htm [doi: 10.3724/SP.J.1001.2008. 0017].
  • 5Cousot P, Cousot R. Static determination of dynamic properties of programs. In: Robinct B, cd. Proc. of the 2nd Int'l Symp. on Programming. Paris: Dunod, 1976. 106-130.
  • 6Cousot P, Halbwachs N. Automatic discovery of linear restraints among variables of a program. In: Proc. of the 5th POPL. New York: ACM Press, 1978.84-97.
  • 7Mine A. The octagon abstract domain. Higher-Order and Symbolic Computation, 2006,19(1):31-100.
  • 8Simon A, King A, Howe JM. Two variables per linear inequality as an abstract domain. In: Leuschel M, ed. Proc. of the LOPSTR 2002. LNCS 2664, Berlin: Springer-Verlag, 2003.71-89.
  • 9Sankaranarayanan S, Sipma H, Manna Z. Scalable analysis of linear systems using mathematical programming. In: Cousot R, ed. Proc. of the VMCAI 2005. LNCS 3385, Berlin: Springer-Verlag, 2005.25-41,.
  • 10Laviron V, Logozzo F. SubPolyhedra: A (more) scalable approach to infer linear inequalities. In: Jones N, Muller-Olm M, eds. Proc. of the VMCAI 2009. LNCS 5403, Berlin: Springer-Verlag, 2009. 229-244.

共引文献2

同被引文献20

引证文献9

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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