One of the most important considerations for a dataflow multiprocessor is the algorithm by which the nodes of a program graph are allocated for execution to its processors. In the case of the static type of architecture one must consider pipelining as well as spatial concurrency. This paper uses a graph partitioning scheme to aid in the design of such
Le Baron Ferguson hasn't uploaded this paper.
Create a free Academia account to let Le Baron know you want this paper to be uploaded.
