创新点
(1) 通过扩展语句依赖图构建了一种新的有向依赖关系图,该依赖关系图同时包含数组和语句之间的依赖关系信息,便于分析SLP向量化识别的过程
(2) 提出了一种基于该有向依赖图内节点之间可达性分析的SLP向量化识别过程,根据节点之间的可达性关系可以分析出SLP向量化关注的所有依赖关系信息
(3) 在Open64-5.0编译器中实现了SLP向量化算法,并大幅提升了Open64-5.0编译器识别和发掘程序SLP向量化的能力
(4) 利用优化后的Open64-5.0编译器对实际应用程序进行了测试,结果表明优化后的Open64-5.0编译器识别SLP向量化的能力优于GCC4.9编译器,与Intel14.0编译器相当;对部分应用程序,利用优化后的Open64编译器实现SLP向量化,其性能优于商业编译器。
This is a preview of subscription content, log in via an institution to check access.
References
Larsen S, Amarasinghe S. Exploiting superword level parallelism with multimedia instruction sets. In: Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. New York: ACM, 2000. 145–156
Padua D A, Wolfe M J. Advanced compiler optimizations for supercomputers. Commun ACM, 1986, 29: 1184–1201
Bulic P, Gustin V. D-test: an extension to Banerjee test for a fast dependence analysis in a multimedia vectorizing compiler. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS). Washington: IEEE Computer Society, 2004. 535–546
Liu J, Zhang Y, Jang O, et al. A compiler framework for extracting superword level parallelism. In: Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation. New York: ACM, 2012. 347–358
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors declare that they have no conflict of interest.
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Zhao, J., Zhao, R. Identifying superword level parallelism with extended directed dependence graph reachability. Sci. China Inf. Sci. 60, 019103 (2017). https://doi.org/10.1007/s11432-015-0163-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-015-0163-7