Data Flow Graph (DFG)

Seen in SE465.

A data-flow graph (DFG) is a graph which represents a data dependancies between a number of operations.

ECE222

Allow us to look at a higher level of abstraction. For example:

We can improve performance using parallelism: one ALU (0.5 MAC/cycle) in (i) vs. two ALUs (one MAC/cycle in (ii))