Program dependence graph

On this page

Representation of graph notation

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.

Related Image Collections Add Image

Profiles

1 Image

We don't have any YouTube videos related to Program dependence graph yet.

You can add one yourself here.

We don't have any PDF documents related to Program dependence graph yet.

You can add one yourself here.

We don't have any Books related to Program dependence graph yet.

You can add one yourself here.

We don't have any archived web articles related to Program dependence graph yet.

You can submit a link to a page to archive here.

References

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. /wiki/Jeanne_Ferrante ↩
"Dependence Graphs in LLVM — LLVM 19.0.0git documentation". llvm.org. Retrieved 2024-06-26. https://llvm.org/docs/DependenceGraphs/index.html ↩

See also

References