摘要： 在程序自动并行化中过程中，数据收集阶段可能产生冗余通信，该文利用数组终写关系分析的方法来消除冗余通信，实现嵌套循环中数组数据最后写关系的快速求解，并将结果提供给编译器后端，生成精确数据收集代码。描述数组终写关系的研究目的和内容，将所处理的嵌套循环根据其结构特征进行分类，给出实现算法的过程。测试结果证明了该算法的正确性和高效性，所产生的精确数据收集代码能够有效地消除部分冗余通信，从而优化和提高了并行化程序的性能。

关键词: 并行编译, 数组终写关系分析, 精确数据收集, 自干扰, 线性不等式

Abstract: In order to eliminate redundant communication generated in data collection of automatic program parallelization, array last-write relation analysis is proposed to implement fast computation of array data last-write relation in loop nest, whose result is necessary condition for generating accurate data collection code in backend of compiler. This paper describes the aim and content of array last-write analysis, sorts the loop nests into different types according to their construction characteristic, and presents the algorithm implementation process in detail for each type. The test result shows the high performance and accuracy of the algorithm. And the accurate data collection code can efficiently eliminate part of redundant communication, which optimizes the parallel programs.

Key words: parallel compiling, array last-write relation analysis, accurate data collection, self-interfere, linear inequality

中图分类号: 

• TP314