基于重排序变换和循环分布的通信优化算法  

Communication Optimization Algorithm Using Reordering Transformation and Loop Distribution

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

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

出　　处：《计算机科学》2012年第9期296-301,共6页Computer Science

基　　金：核高基重大专项(2009ZX01036-001-001-2)资助

摘　　要：针对现有通信优化算法无法使MPI自动并行化编译器生成加速比理想的消息传递程序问题,提出了一种基于重排序变换和循环分布的通信优化算法。该算法根据给出的过程间副作用集合和基于mpi_wait/mpi_irecv移动的重排序变换规则,有序地采用重排序变换和循环分布,尽可能安全地扩大点到点非阻塞通信中通信与计算的重叠窗口,使MPI自动并行化编译器生成具有更多计算重叠通信的消息传递代码。实验结果表明,该算法能够隐藏更多的点到点非阻塞通信开销,并且明显提升消息传递程序的加速比。Aiming at the problem that existing communication optimization algorithms can’t make MPI automatic parallelizing compilers to generate message-passing programs of ideal speedups,this paper proposed a communication optimization algorithm using reordering transformation and loop distribution.According to the interprocedural side effect sets and reordering transformation rule based on mpi_wait/mpi_irecv movements,this algorithm makes orderly use of reordering transformation and loop distribution,and then expands communication-computation overlap windows of the point-to-point non-blocking communication as safely as possible,so that MPI automatic parallelizing compilers can generate message-passing codes of overlapping communication with more computation.Experimental results show that this algorithm can hide more point-to-point non-blocking communication overheads than others and improve their speedups significantly.

关 键 词：重排序变换 循环分布 通信优化 并行化编译 点到点非阻塞通信 通信与计算重叠 

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