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" (PDF). ACM Transactions on Programming Languages and Systems. 9 (3): 319–349. CiteSeerX 10.1.1.101.27. doi:10.1145/24039.24041. S2CID 505075.
  2. ↑ Ferrante, J.; Ottenstein, K. J.; Warren, J. (1987). "The program dependence graph and its use in optimization". ACM Transactions on Programming Languages and Systems. 9 (3): 319–349. doi:10.1145/24039.24041. S2CID 505075.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.