基于Define-Use图的MPI通信求解算法  

MPI Communication Solving Algorithm Based on Define-Use Graph

作　　者：赵捷[1] 赵荣彩[1] 丁锐[1] 陈达智[1] 

机构地区：[1]解放军信息工程大学信息工程学院,郑州450002

出　　处：《计算机工程》2012年第4期247-250,共4页Computer Engineering

基　　金："核高基"重大专项"支持国产CPU的编译系统及工具链"分课题"自动并行化与二进制翻译系统"(2009ZX01036-001-001-2)

摘　　要：针对分布存储计算机系统并行编译过程中,为维持数据一致性而产生冗余通信的问题,提出一种优化的通信求解算法。该算法基于依赖关系分析和过程间数据流分析,通过遍历Define-Use图,获得更精确的通信数据,消除过程调用时产生的冗余通信。实验结果表明,将算法所得结果作为后端生成MPI通信代码的依据,可以有效减少通信量,加速比接近手工MPI并行程序。Some redundant communications are introduced in parallel compilation of distributed-memory multi-computers to guarantee the consistency of program data. To solve this problem, this paper proposes an optimizing communications calculating algorithm. Based on dependence analysis and inter-procedural data-flow analysis, the algorithm can figure out more accurate communications data by traversing the Define-Use graph and eliminate the redundant communications generated by procedure calls. Experimental results show that using the results of the algorithm to generate MPI communications code can reduce the communications data and the speed-up ratio is close to manual MPI parallel program.

关 键 词：Open64编译器 冗余通信 MPI协议 并行编译 Define-Use图 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]