Optimal and fast throughput evaluation of CSDF - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Optimal and fast throughput evaluation of CSDF

Bruno Bodin
  • Function : Author
  • PersonId : 945445
Benoît Dupont de Dinechin
  • Function : Author
  • PersonId : 947915


The Synchronous Dataow Graph (SDFG) and Cyclo-Static Dataow 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.

Dates and versions

hal-01358062 , version 1 (30-08-2016)



Bruno Bodin, Alix Munier-Kordon, Benoît Dupont de Dinechin. Optimal and fast throughput evaluation of CSDF. Design Automation Conference DAC, Jun 2016, Austin, United States. pp.160, ⟨10.1145/2897937.2898056⟩. ⟨hal-01358062⟩
123 View
0 Download



Gmail Facebook X LinkedIn More