Lines Matching refs:DDG

22 In its simplest form the Data Dependence Graph (or DDG) represents data
29 As described in [1]_ the DDG uses graph abstraction to group nodes
48 itself creating a cycle in the DDG. The figure bellow illustrates
54 The DDG corresponding to this example would have a pi-block that contains
63 DDG, but it is capable of representing both data dependencies and
71 The DDG and the PDG are both directed graphs and they extend the
84 are ignored. The steps in the build algorithm for the DDG are very
87 allow creation of both DDG and PDG representations while allowing
112   - Builder allows graph construction code to be reused for DDG and PDG.
113   - Builder allows us to create DDG and PDG as separate graphs.
114 …- DDG nodes and edges are completely disjoint from PDG nodes and edges allowing them to change eas…
119 …- There are some similarities between DDG nodes and edges compared to PDG nodes and edges, but the…
129 The current implementation of DDG differs slightly from the dependence
132 …nts*, *for loop headers* and *while loop headers*. In this implementation, DDG nodes naturally rep…
134 …, pi-blocks are only created for *recurrences*. *IN* nodes remain as simple DDG nodes in the graph.