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

摘要

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/mp_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 ge-nerate 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 speed-ups significantly.%针对现有通信优化算法无法使MPI自动并行化编译器生成加速比理想的消息传递程序问题,提出了一种基于重排序变换和循环分布的通信优化算法.该算法根据给出的过程间副作用集合和基于mpi_wait/mpi_irecv移动的重排序变换规则,有序地采用重排序变换和循环分布,尽可能安全地扩大点到点非阻塞通信中通信与计算的重叠窗口,使MPI自动并行化编译器生成具有更多计算重叠通信的消息传递代码.实验结果表明,该算法能够隐藏更多的点到点非阻塞通信开销,并且明显提升消息传递程序的加速比.