Analyzing Programs with Explicit Parallelism

摘要: Abstract: "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."