Abstract: Precise array data-flow analysis is an important step in parallelizing compiler technique. Stanford University presents an algorithm to calculate an LWT for a single pair of read and write statements. This paper researches and implements an LWT intersect algorithm in order to analyze precise data dependence relationship with multiple writes and common read. The result of this algorithm eliminates a lot of redundant information and improves the precise array data-flow analysis technique.

Key words: precise array data-flow analysis, Last Write Tree(LWT), intersect LWTs

摘要： 精确的数组数据流分析是并行编译技术中的重要步骤。用终写树算法表示精确的数组数据流分析仅针对一对读写引用。该文研究并在工程上实现了终写树交叉算法，以分析多个写引用与公共读引用之间的精确数据依赖关系，减少了冗余信息并使精确数组数据流分析技术得到一定程度的优化。

关键词: 精确的数组数据流分析, 终写树, LWT树的交叉

CLC Number: 

• TP311