Optimal and fast throughput evaluation of CSDF

The Synchronous Dataflow Graph (SDFG) and Cyclo-Static Dataflow Graph (CSDFG) are two well-known models, used practically by industry for many years, and for which there is a large number of analysis techniques. Yet, basic problems such as the throughput computation or the liveness evaluation are no...

Full description

Saved in:
Bibliographic Details
Published in2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC) pp. 1 - 6
Main Authors Bodin, Bruno, Munier-Kordon, Alix, de Dinechin, Benoit Dupont
Format Conference Proceeding
LanguageEnglish
Published IEEE 05.06.2016
Subjects
Complexity theory
Computational modeling
Cyclo-Static Dataflow Graph
Optimal scheduling
Processor scheduling
Schedules
Scheduling
Static analysis
Throughput
Online AccessGet full text

Cover

More Information
Summary:The Synchronous Dataflow Graph (SDFG) and Cyclo-Static Dataflow Graph (CSDFG) are two well-known models, used practically by industry for many years, and for which there is a large number of analysis techniques. Yet, basic problems such as the throughput computation or the liveness evaluation are not well solved, and their complexity is still unknown. In this paper, we propose K-Iter, an iterative algorithm based on K-periodic scheduling to compute the throughput of a CSDFG. By using this technique, we are able to compute in less than a minute the throughput of industry applications for which no result was available before.
DOI:10.1145/2897937.2898056