SCHEDULING DYNAMIC DATAFLOW GRAPHS WITH BOUNDED MEMORY USING THE TOKEN FLOW MODEL

by Joseph T. Buck and Edward A. Lee

Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing,
Minneapolis, MN, vol. I pp. 429-432.
April 1993

[PDF]

ABSTRACT

This paper builds upon research by Lee [1] concerning the token flow model, an analytical model for the behavior of dataflow graphs with data-dependent control flow, by analyzing the properties of cycles of the schedule: sequences of actor executions that return the graph to its initial state. Necessary and sufficient conditions are given for the existence of a bounded cyclic schedule, as well as sufficient conditions for execution of the graph in bounded memory. The techniques presented in this paper apply to a more general class of dataflow graphs than existing methods.

[1]This work was supported by a grant from the Semiconductor Research Corporation (93-DC-008)