Scheduling dynamic dataflow graphs with bounded memory using the token flow model 论文
1993IEEE International Conference on Acoustics Speech and Signal Processing引用 458
Embedded Systems Design TechniquesParallel Computing and Optimization TechniquesFormal Methods in Verification
详细信息
- 发表期刊/会议
- IEEE International Conference on Acoustics Speech and Signal Processing
- 发表日期
- 1993-01-01
- 发表年份
- 1993
关键词
Embedded Systems Design TechniquesParallel Computing and Optimization TechniquesFormal Methods in Verification
摘要
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>