Scheduling of dynamic dataflow programs based on state space analysis
Johan Ersfolk, Ghislain Roquier, Johan Lilius, Marco Mattavelli · 2012
Compile-time scheduling of dynamic dataflow programs is still an open problem. This paper presents how scheduling of dynamic portions of asynchronous dataflow networks described using CAL language can be determined before execution by the analysis of the state space of network partitions. Experiments show that the number of run-time operations employed by dynamic schedulers is largely reduced when the schedules extracted by the state analysis are employed.