Compiler I WS 2001/2002 - Slide 73
Objectives:
Represent dependencies
In the lecture:
- graph representation of dependencies that are specified by computations,
- compose the graphs to yield a tree with dependencies,
- explain indirect dependencies
- Use the graphs as an example for partitions (CI-72)
- Use the graphs as an example for LAG(k) algorithm (CI-77)
©2001 by Prof. Dr. Uwe Kastens
Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 10.04.2006