Abstract: The parallel code that the compiler generates automatically leads to code expansion and unnecessary running time increase if it includes too much redundant code. This paper presents an optimization technique to eliminate redundant communication code by using Fourier-Motzkin- elimination algorithm for linear inequalities of computation decompositions and data decomposition. The test results show that the technique is able to reduce the size of the code by 10 to 30 percent compared with the original code, and the speedup achieves 1.12 on average using the same number of processors.

Key words: automatic parallel code generation, redundant communication elimination, linear inequalities, communication optimization

摘要： 若自动生成的并行化代码中包含过多的冗余代码，将导致代码膨胀，同时增加不必要的时间开销。该文通过对计算划分不等式和依赖关系不等式进行傅立叶消元，消除并行化代码中的冗余通信部分，实现通信优化。测试结果表明，与通信优化前的代码相比，消除后的并行代码量减少了10%~30%，处理器数目相同的情况下加速比平均达到1.12。

关键词: 并行化代码自动生成, 冗余通信消除, 线性不等式, 通信优化

CLC Number: 

• TP314