Compile-Time Scheduling of Dynamic Constructs in Data ow Program Graphs

@inproceedings{Lee1997CompileTimeSO,
  title={Compile-Time Scheduling of Dynamic Constructs in Data ow Program Graphs},
  author={Edward A. Lee},
  year={1997}
}
|Scheduling data ow graphs onto processors consists of assigning actors to processors, ordering their execution within the processors, and specifying their ring time. While all scheduling decisions can be made at runtime, the overhead is excessive for most real systems. To reduce this overhead, compile-time decisions can be made for assigning and/or ordering actors on processors. Compile-time decisions are based on known pro les available for each actor at compile time. The pro le of an actor… CONTINUE READING
Highly Cited
This paper has 55 citations. REVIEW CITATIONS