UC BERKELEY
EECS technical reports
TECHNICAL REPORTS


CSD-92-716.pdf
CSD-92-716.ps
Oskicat catalog record
Conditions of Use

Archive Home Page

Two Fundamental Limits on Dataflow Multiprocessing

Authors:
Culler, David E.
Schauser, Klaus Erik
von Eicken, Thorsten
Technical Report Identifier: CSD-92-716
December 1992
CSD-92-716.pdf
CSD-92-716.ps

Abstract: This paper examines the argument for dataflow architectures in "Two Fundamental Issues in Multiprocessing." We observe two key problems. First, the justification of extensive multithreading is based on an overly simplistic view of the storage hierarchy. Second the local greedy scheduling policy embodied in dataflow is inadequate in many circumstances. A more realistic model of the storage hierarchy imposes significant constraints on the scheduling of computation and requires a degree of parsimony in the scheduling policy. In particular, it is important to establish a scheduling hierarchy that reflects the underlying storage hierarchy. However, even with this improvement, simple local scheduling policies are unlikely to be adequate.

Keywords: dataflow, multiprocessing, multithreading, latency tolerance, storage hierarchy, scheduling hierarchy.