Analyzing Programs with Explicit Parallelism

Analyzing Programs with Explicit Parallelism
复制标题

分析具有显式并行性的程序

DOI:
--
复制
发表时间:
1991
期刊:
International Workshop on Languages and Compilers for Parallel Computing
影响因子:
--
通讯作者:
M. Wolfe
M. Wolfe
中科院分区:
--
文献类型:
--
作者:
H. Srinivasan;M. Wolfe

文献摘要

被引文献

相似文献

在使用并行命令式结构(例如Cobegin/Coend)分析程序时,标准的计算机中间表示(控制流程图)是不足的。本文讨论了并行构造的语义,并引入了新的中间形式,称为并行控制流程图和并行优先图。这些数据结构在编译器分析和优化方面具有一定的优势。作为优势的一个示例,给出了将明确并行程序转换为静态单分配表格的分析要求。为此,必须定义明确平行程序的优势关系和优势前沿。
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.