Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
复制标题
DOI：
10.1109/icassp.1993.319147
复制
发表时间：
1993-04
期刊：
影响因子：
--
通讯作者：
J. Buck;Edward A. Lee
中科院分区：
文献类型：
--
作者：
J. Buck;Edward A. Lee
作者在E. A. Lee（1991）关于令牌流模型，一种分析具有数据依赖控制流的图的行为的分析模型，通过分析调度周期的属性：使图返回其初始状态的演员执行序列。给出了有界循环调度存在的充要条件以及在有界内存中执行图的充分条件。所提出的技术适用于比以前的方法更一般的类的图。
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.>