RDF: Reconfigurable Dataflow (extended version)

Abstract : Dataflow Models of Computation (MoCs) are widely used in embedded systems, including multimedia processing, digital signal processing, telecommunications, and automatic control. In a dataflow MoC, an application is specified as a graph of actors connected by FIFO channels. One of the most popular dataflow MoCs, Synchronous Dataflow (SDF), provides static analyses to guarantee boundedness and liveness, which are key properties for embedded systems. However, SDF (and most of its variants) lacks the capability to express the dynamism needed by modern streaming applications. In particular, the applications mentioned above have a strong need for reconfigurability to accommodate changes in the input data, the control objectives, or the environment. We address this need by proposing a new MoC called Reconfigurable Dataflow (RDF). RDF extends SDF with transformation rules that specify how the topology and actors of the graph may be reconfigured. Starting from an initial RDF graph and a set of transformation rules, an arbitrary number of new RDF graphs can be generated at runtime. A key feature of RDF is that it can be statically analyzed to guarantee that all possible graphs generated at runtime will be consistent and live. We introduce the RDF MoC, describe its associated static analyses, and outline its implementation.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/hal-02079683
Contributor : Pascal Fradet <>
Submitted on : Wednesday, March 27, 2019 - 6:43:29 PM
Last modification on : Wednesday, June 19, 2019 - 2:30:50 PM

File

RR9227.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02079683, version 2

Collections

Citation

Pascal Fradet, Alain Girault, Ruby Krishnaswamy, Xavier Nicollin, Arash Shafiei. RDF: Reconfigurable Dataflow (extended version). [Research Report] RR-9227, INRIA Grenoble - Rhône-Alpes. 2018, pp.1-19. ⟨hal-02079683v2⟩

Share

Metrics

Record views

41

Files downloads

253