Program dependence graph explained

A Program Dependence Graph (PDG) is a directed graph of a program's control and data dependencies. Nodes represent program statements and edges represent dependencies between these statements.

PDGs are used in optimization, debugging, and understanding program behavior. One example of this is their utilization by compilers during dependence analysis, enabling the optimizing compiler to make transformations to allow for parallelism.^{[1] [2]}

See also

• Dependency graph
• Control-flow graph
• Data-flow analysis
• Static program analysis

Notes and References

1. . Ottenstein . Karl J. . Warren . Joe D. . July 1987 . The Program Dependence Graph and its Use in Optimization . ACM Transactions on Programming Languages and Systems . en . 9 . 3 . 319–349 . 10.1.1.101.27 . 10.1145/24039.24041 . 505075.
2. Web site: Dependence Graphs in LLVM — LLVM 19.0.0git documentation . 2024-06-26 . llvm.org.