Program dependence graph

From HandWiki
Short description: Representation of graph notation

In computer science, a Program Dependence Graph (PDG) is a representation of graph notation that makes a program's dependencies (both 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.[2]

See also

Dependency graph

References

  1. ↑ Jeanne Ferrante; Ottenstein, Karl J.; Warren, Joe D. (July 1987). "The Program Dependence Graph and its Use in Optimization" (in en). ACM Transactions on Programming Languages and Systems 9 (3): 319–349. doi:10.1145/24039.24041. https://www.cs.utexas.edu/~pingali/CS395T/2009fa/papers/ferrante87.pdf. 
  2. ↑ Ferrante, J.; Ottenstein, K. J.; Warren, J. (1987). "The program dependence graph and its use in optimization" (in en). ACM Transactions on Programming Languages and Systems 9 (3): 319–349. doi:10.1145/24039.24041. 



Retrieved from "https://handwiki.org/wiki/index.php?title=Program_dependence_graph&oldid=3371630"