Data Flow Equations for Explicitly Parallel Programs

Abstract

We present a solution to the reaching definitions problem for programs with explicit lexically specified parallel constructs, such as cobegin/coend or parallel_sections, both with and without explicit synchronization operations, such as Post, Wait or Advance. The reaching definitions information for sequential programs is used to solve many standard… (More)
DOI: 10.1145/155332.155349

6 Figures and Tables

Topics

Statistics

0510'96'99'02'05'08'11'14'17
Citations per Year

104 Citations

Semantic Scholar estimates that this publication has 104 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics