Dataflow (cont)
In pure dataflow machines, no concept of separate storage for data values.
- Each Data Flow Graph (DFG) node is an instruction. Incoming data is placed in slots that make up the DFG node. When input slots are full, the node is executed
How do we determine that DFG node is ready to be executed?
- Have a tag associated with each operand. Could be as simple as a 1 bit tag (1: operand present, 0: operand absent).
- Need to do an associative search over all DFG nodes in memory. Any nodes that are ready to fire (both operands present) are executed.