Jump to content

Program dependence graph

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Headbomb (talk | contribs) at 18:32, 19 June 2016 (→‎top: clean up, replaced: ACM Transactions on Programming Languages and Systems (TOPLAS) → ACM Transactions on Programming Languages and Systems using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Program Dependence Graph (PDG) in computer science is a representation, using graph notation that makes data dependencies and control dependencies explicit.[1] These dependencies are used during dependence analysis in optimizing compilers to make transformations so that multiple cores are used, and parallelism is improved.

see: dependency graph

References

  1. ^ Jeanne Ferrante; Ottenstein, Karl J.; Warren, Joe D. (July 1987). "The Program Dependence Graph and its Use in Optimization" (PDF). ACM Transactions on Programming Languages and Systems. 9 (3). ACM: 319–349. doi:10.1145/24039.24041.