“…As with all dataflow architectures (e.g. [9,8,17,33,15,28,31,14,27,7,3]), an application is represented as a dataflow graph (DFG), with control dependences converted into data dependences. Nodes in the graph are instructions, and directed edges between them represent operand dependences.…”