Analyzing Programs with Explicit Parallelism
Analyzing Programs with Explicit Parallelism
复制标题
分析具有显式并行性的程序
DOI:
--
复制
发表时间:
1991
期刊:
影响因子:
--
通讯作者:
M. Wolfe
中科院分区:
文献类型:
--
作者:
H. Srinivasan;M. Wolfe
When analyzing programs with parallel imperative constructs (e.g., cobegin/coend), standard computer intermediate representations (Control Flow Graphs) are inadequate. This paper discusses semantics for parallel constructs, and introduces new intermediate forms, called the Parallel Control Flow Graph and the Parallel Precedence Graph. These data structures have certain advantages for compiler analysis and optimization. As an example of the advantages, the analysis requirements of converting an explicitly parallel program into Static Single Assignment form are given. To do this, the dominance relation and dominance frontiers for explicitly parallel programs must be defined.