Dynamically partitioned dataflow

Discusses the dynamically partitioned dataflow architecture. It executes maximally persistent threads along data dependent paths in the dataflow graph. Only where such a path cannot be pursued further, does the architecture resort to the more conventional approach: pushing the pipeline with an instruction from elsewhere. To mask the latency of next instruction address calculation, a novel lookahead mechanism is employed.<
>