Program dependence graph

This article has multiple issues. Please help or discuss these issues on the talk page. (Learn how and when to remove these template messages) This article needs additional citations for verification. Please help by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources:  –  ·  ·  · scholar · JSTOR (May 2016) (Learn how and when to remove this template message) This article's tone or style may not reflect the encyclopedic tone used on Wikipedia. See Wikipedia's guide to writing better articles for suggestions. (October 2012) (Learn how and when to remove this template message) This article may be too technical for most readers to understand. Please to make it understandable to non-experts, without removing the technical details. (October 2012) (Learn how and when to remove this template message) (Learn how and when to remove this template message)

In computer science, a program dependence graph (PDG) 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[]

This computer science article is a stub. You can help Wikipedia by .

• v
• t