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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
