DMCA
Scheduling Dynamic Dataflow Graphs With Bounded Memory Using The Token Flow Model (1993)
| Citations: | 232 - 5 self |
BibTeX
@TECHREPORT{Buck93schedulingdynamic,
author = {Joseph T. Buck and Edward A. Lee},
title = {Scheduling Dynamic Dataflow Graphs With Bounded Memory Using The Token Flow Model},
institution = {},
year = {1993}
}
Share
 |
 |
 |
 |
||
OpenURL
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. MOTIVATION Dataflow graphs have proven to be an effective representation for problems in digital signal processing, both because the representation is natural for DSP researchers and because the representation exposes the parallelism of the algorithm and imposes minimal constraints on the order of its evaluation. Since the representation does not over-constrain the order of operations, a scheduler has the freedom i...
Keyphrases
token flow model bounded memory dynamic dataflow graph dataflow graph sufficient condition data-dependent control flow initial state effective representation minimal constraint motivation dataflow graph bounded cyclic schedule analytical model dsp researcher digital signal processing general class actor execution
