Programming Languages and Compilers WS 2013/14 - Slide 409
Objectives:
Represent dependences
In the lecture:
- graph representation of dependences that are specified by computations,
- compose the graphs to yield a tree with dependences,
- explain indirect dependences
- Use the graphs as an example for partitions (PLaC-4.9)
- Use the graphs as an example for LAG(k) algorithm (see a later slide)
©2009 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 07.10.2013