首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于动态规划的自动向量化方法
引用本文:吕鹏伟,刘从新,赵一明,沈绪榜.基于动态规划的自动向量化方法[J].北京理工大学学报,2017,37(5):544-550.
作者姓名:吕鹏伟  刘从新  赵一明  沈绪榜
作者单位:西安微电子技术研究所,陕西,西安710065;西安微电子技术研究所,陕西,西安710065;西安微电子技术研究所,陕西,西安710065;西安微电子技术研究所,陕西,西安710065
基金项目:国家部委重大专项基金资助项目(2014ZX01020-003);国家自然科学基金资助项目(61136002)
摘    要:由于SLP自动向量化算法使用的启发式策略会丢失一定的向量化机会,本文提出一种基于动态规划的自动向量化方法DPSLP,该方法采用比SLP更加激进的策略在基本块内寻找候选的SIMD指令分组,依据动态规划方程计算指令分组的代价并从众多指令分组中选择最优的分组进行向量化转换.实验结果显示,DPSLP与SLP相比测试程序的运行时间平均减少了8%,静态指令代价平均减少10%,平均向量宽度增加66.4%. 

关 键 词:自动向量化  动态规划  指令代价
收稿时间:2016/4/15 0:00:00

Auto-Vectorization Method Based on Dynamic Programming
L&#; Peng-wei,LIU Cong-xin,ZHAO Yi-ming and SHEN Xu-bang.Auto-Vectorization Method Based on Dynamic Programming[J].Journal of Beijing Institute of Technology(Natural Science Edition),2017,37(5):544-550.
Authors:L&#; Peng-wei  LIU Cong-xin  ZHAO Yi-ming and SHEN Xu-bang
Institution:Xi'an Institute of Microelectronics Technology, Xi'an, Shaanxi 710065, China
Abstract:As SLP (super-word level parallelism) auto-vectorization algorithm will lose some vectorization opportunities by using heuristic strategy, an auto-vectorization method named DPSLP that based on dynamic programming was proposed in this paper. In this method, the candidate statement groups were searched for SIMD (single instruction multiple data) instruction by using more aggressive strategy than SLP, and the optimal statement groups were selected to vectorize according to the cost of which calculated by dynamic programming formula. Experimental result show that DPSLP achieves on average a total decrease of 8% in execution time, 10% in static instruction cost and increase of 66.4% in vector width, compared with SLP.
Keywords:auto-vectorization  dynamic programming  instruction cost
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京理工大学学报》浏览原始摘要信息
点击此处可从《北京理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号