Title :
Dynamically partitioned dataflow
Author :
Gottlieb, Isreal ; Singer
Author_Institution :
Dept. of Math. & Comput. Sci., Bar Ilan Univ., Ramat Gan, Israel
Abstract :
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
Keywords :
parallel architectures; data dependent paths; dataflow graph; dynamically partitioned dataflow architecture; lookahead mechanism; maximally persistent threads; next instruction address calculation; Clocks; Data mining; Delay; Filling; Gallium nitride; Mathematics; Pipelines; System recovery; Writing; Yarn;
Conference_Titel :
System Sciences, 1992. Proceedings of the Twenty-Fifth Hawaii International Conference on
Conference_Location :
Kauai, HI
Print_ISBN :
0-8186-2420-5
DOI :
10.1109/HICSS.1992.183203
