Modeling static-order schedules in synchronous dataflow graphs
conference paper
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 staticorder 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.
Topics
TNO Identifier
954388
ISSN
15301591
ISBN
9783981080186
Publisher
Institute of Electrical and Electronics Engineers Inc. (IEEE)
Article nr.
6176588
Source title
Proceedings -Design, Automation and Test in Europe, DATE, 15th Design, Automation and Test in Europe Conference and Exhibition, DATE 2012, 12 March 2012 through 16 March 2012
Pages
775-780
Files
To receive the publication files, please send an e-mail request to TNO Repository.