期刊文献+

自动向量化中基于数据依赖分析的循环分布算法

Loop Distribution Algorithm Based on Data Dependence Analysis in Auto-vectorization
下载PDF
导出
摘要 循环分布是开发向量化程序的一个有效的方法。但是由于程序中的数据相关性,当前的自动向量化编译器实现完全的循环分布非常困难。因此,当前的自动向量化编译器一般采用简单的循环分布方法。以数据依赖关系分析为基础,从有无依赖环的角度分析了程序中语句的向量化能力,提出了基于语句向量化识别的循环分布算法,并在自动向量化中加以实现。通过此方法,可以充分地分析语句或依赖环的向量化能力,最终采用循环分布,将可向量化的语句与不可向量化的语句分布在不同的循环中。该方法可以处理当前的自动向量化编译器无法向量化的循环,对一些语句间有依赖关系的循环可达到较好的效果。 Loop distribution is a useful method to vectorization programs,but because of the data dependence,it's very hard to completely achieve loop distribution in auto-vectorization.So,it's usually used easily loop distribution in current auto-vectorization compiler.Here,discussed a new loop distribution method based on identify the statement vectorization,from the data dependence view,and achieved in current auto-vectorization compiler.By this method,we can completely analyse which statement can vectorize,which dependence cycle can vectorize,finally using loop distribution,the vectorization statements can and no-vector statements be distributed in different loops.This method can handle these loops which can't be vectorized by other auto-vectorization compilers,and have good effect for some loops which have complex dependence.
出处 《计算机科学》 CSCD 北大核心 2011年第9期288-293,共6页 Computer Science
基金 核高基重大专项"支持国产CPU的编译系统及工具链"(2009ZX01036-001-001-2)资助
关键词 自动向量化 SIMD 依赖关系分析 循环分布 Auto-vectorization SIMD Data dependence analysis Loop distribution
  • 相关文献

参考文献8

  • 1Allen R, Kennedy K. Optimizing Compilers for Modern Architectures- A Dependence-Based Approach [M]. US: Morgan Kaufmann Publishers, 2001.
  • 2Larsen S, Amarasinghe S. Exploiting superword level parallelism with multimedia instruction sets[C]//Proc of the ACM SIGP- LAN Conference on Programming Language Design and Implementation. 2000 : 145-156.
  • 3Stewart J. An investigation of SIMD instruction sets [R]. University of Ballarat School of Information Technology and Mathematical Sciences. 2005.
  • 4Kennedy K, Mckinley K S. Loop distribution with arbitrary control flow[C]//Proceedings of the 1990 Conference on Supercomputing. 1990 : 407-416.
  • 5Kennedy K, Mckinley K S. Loop distribution with multiple exits [C]//Proceedings of the 1992 ACM/IEEE Conference on Su- percomputing. Minneapolis, Minnesota, United States, 1992 : 204-213.
  • 6Lengauer T,Tarjian R E. A fast algorithm for finding dominators in a iqowgraph[J]. ACM Transactions on Programming Languages and Systems, 1979 : 1 (1): 121-141.
  • 7Tarjian R E. Depth first search and liner graph algorithms[J]. SIAM Journal Of Computing, 1972,1 (2) : 146-160.
  • 8曾扬.循环分布及依赖关系破除的优化问题[J].计算机学报,1993,16(6):470-475. 被引量:1

二级参考文献4

  • 1曾扬,计算机学报,1993年,16卷,2期
  • 2Chen Z,IEEE Trans Parallel Distrib Syst,1990年,1卷,3期
  • 3计算机工程与科学,1986年,3/4期
  • 4郭强,计算机学报,1985年,8卷,5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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