Static Scheduling and Code Generation from Dynamic Dataflow Graphs With Integer-Valued Control Streams
Joseph T. BuckPresented at 28th Asilomar Conference on Signals, Systems, and Computers
November 1994
Prepublished version |
Published version |
ABSTRACT
This paper extends the token flow model of Buck and Lee ([1],[2]), an analytical model for the behavior of dataflow graphs with data-dependent control flow, in two ways: dataflow actor execution may depend on integer, rather than Boolean, control tokens, and multiphase implementations of actors are permitted. These extensions permit data-dependent iteration to be modelled more naturally, reduce the memory required for implementations, and result in bounded-memory solutions in more cases than before. A method for generating efficient single-processor programs from the graphs is also described.[1] J. Buck, "Scheduling Dynamic Dataflow Graphs With Bounded Memory Using the Token Flow Model," Memorandum No. UCB/ERL M93/69 (Ph.D. Thesis), EECS Dept., University of California, Berkeley, September 1993.
[2] E. A. Lee, "Consistency in Dataflow Graphs", IEEE Transactions on Parallel and Distributed Systems", Vol. 2, No. 2, April 1991.