Scheduling dynamic dataflow graphs with bounded memory using the token flow model
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15206149) , 429-432 vol.1
- https://doi.org/10.1109/icassp.1993.319147
Abstract
The authors build upon research by E. A. Lee (1991) 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 apply to a more general class of dataflow graphs than previous methods.Keywords
This publication has 5 references indexed in Scilit:
- Scheduling dynamic dataflow graphs with bounded memory using the token flow modelPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Well-behaved dataflow programs for DSP computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Consistency in dataflow graphsIEEE Transactions on Parallel and Distributed Systems, 1991
- Gabriel: a design environment for DSPIEEE Micro, 1990
- Synchronous data flowProceedings of the IEEE, 1987