Fast and efficient dataflow graph generation

Abstract : Dataflow modeling is a highly regarded method for the design of embedded systems. Measuring the performance of the associated analysis and compilation tools requires an efficient dataflow graph generator. This paper presents a new graph generator for Phased Computation Graphs (PCG), which augment Cyclo-Static Dataflow Graphs with both initial phases and thresholds. A sufficient condition of liveness is first extended to the PCG model. The determination of initial conditions minimizing the total amount of initial data in the channels and ensuring liveness can then be expressed using Integer Linear Programming. This contribution and other improvements of previous works are incorporated in Turbine, a new dataflow graph generator. Its effectiveness is demonstrated experimentally by comparing it to two existing generators, DFTools and SDF3.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01084899
Contributor : Frédéric Davesne <>
Submitted on : Thursday, November 20, 2014 - 12:11:55 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM

Links full text

Identifiers

Citation

Bruno Bodin, Youen Lesparre, Jean-Marc Delosme, Alix Munier-Kordon. Fast and efficient dataflow graph generation. 17th International Workshop on Software and Compilers for Embedded Systems (SCOPES 2014), Jun 2014, Schloss RheinfelsSt. Goar, Germany. pp.40--49, ⟨10.1145/2609248.2609258⟩. ⟨hal-01084899⟩

Share

Metrics

Record views

325