计算机科学 ›› 2012, Vol. 39 ›› Issue (9): 296-301.

• 体系结构 • 上一篇    下一篇

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

陈达智,赵荣彩,韩林,丁锐,赵捷   

  1. (解放军信息工程大学信息工程学院 郑州450002)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Communication Optimization Algorithm Using Reordering Transformation and Loop Distribution

  • Online:2018-11-16 Published:2018-11-16

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

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

Abstract: Aiming at the problem that existing communication optimization algorithms can't make MPI automatic parallelizing compilers to generate messag}passing programs of ideal speedups, this paper proposed a communication optimination 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 rcordering 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 specdups significantly.

Key words: Reordering transformation, Loop distribution, Communication optimization, Parallelizing compilation, Point-to-point non-blocking communication, Communication-computation overlap

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!