Edinburgh Research Explorer

Fast and Efficient Dataflow Graph Generation

Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • Bruno Bodin
  • Youen Lesparre
  • Jean-Marc Delosme
  • Alix Munier-Kordon

Related Edinburgh Organisations

Access status

Open

Documents

http://doi.acm.org/10.1145/2609248.2609258
Original languageEnglish
Title of host publicationProceedings of the 17th International Workshop on Software and Compilers for Embedded Systems
Place of PublicationNew York, NY, USA
PublisherACM
Pages40-49
Number of pages10
ISBN (Print)978-1-4503-2941-5
DOIs
StatePublished - 2014

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.

Research areas

  • CSDFG, PCG, SDFG, cyclo-static data-flow, cyclo-static dataflow graph, graph generation, initial markings, normalization, phased computation graph, random generation, synchronous Dataflow, synchronous dataflow graph

Download statistics

No data available

ID: 19942288