Modeling static-order schedules in synchronous dataflow graphs

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

26 Citaten (Scopus)
90 Downloads (Pure)


Abstract—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.
Originele taal-2Nederlands
TitelProceedings of the Design, Automation & Test in Europe Conference & Exhibition (DATE) 2012, 12-16 March 2012, Dresden, Germany
Plaats van productiePiscataway
UitgeverijInstitute of Electrical and Electronics Engineers
ISBN van geprinte versie978-3-9810801-8-6
StatusGepubliceerd - 2012
Evenement15th Design, Automation and Test in Europe Conference and Exhibition (DATE 2012) - ICC, Dresden, Duitsland
Duur: 12 mrt 201216 mrt 2012
Congresnummer: 15


Congres15th Design, Automation and Test in Europe Conference and Exhibition (DATE 2012)
Verkorte titelDATE 2012
AnderDesign, Automation & Test in Europe 2012, DATE'12
Internet adres

Citeer dit