Modeling Static-Order Schedules in Synchronous Dataflow Graphs
Synchronous dataflow graphs (SDFGs) are used extensively to model streaming applications. An SDFG can be extended with scheduling decisions, allowing SDFG analysis to obtain properties like throughput or buffer sizes for the scheduled graphs. Analysis times depend strongly on the size of the SDFG. SDFGs can be statically scheduled using static-order schedules. The only generally applicable technique to model a static-order schedule in an SDFG is to convert it to a homogeneous SDFG (HSDFG). This conversion may lead to an exponential increase in the size of the graph and to sub-optimal analysis results (e.g., for buffer sizes in multi-processors). We present a technique to model periodic static-order schedules directly in an SDFG. Experiments show that our technique produces more compact graphs compared to the technique that relies on a conversion to an HSDFG. This results in reduced analysis times for performance properties and tighter resource requirements.
- Modeling Static-Order Schedules in Synchronous Dataflow Graphs
M. Damavandpeyma, S. Stuijk, T. Basten, M.C.W. Geilen and H. Corporaal.
In Design, Automation and Test in Europe, DATE 12, Proceedings, pages 775-780. Dresden, Germany, 12-16 March, 2012. EDAA, 2012. (abstract, pdf, doi).