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 first and 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 lack 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 and when 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 present its implementation and some experimental results.
- [1] . 1996. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, Norwell, MA.Google Scholar
Digital Library
- [2] . 2014. A framework to schedule parametric dataflow applications on many-core platforms. In International Conference on Languages, Compilers and Tools for Embedded Systems (LCTES’14). ACM.Google Scholar
Digital Library
- [3] . 2013. BPDF: A statically analyzable dataflow model with integer and Boolean parameters. In International Conference on Embedded Software (EMSOFT’13). 1–10.Google Scholar
Cross Ref
- [4] . 2001. Parameterized dataflow modeling for DSP systems. IEEE Trans. Sig. Process. 49, 10 (2001), 2408–2421.Google Scholar
Digital Library
- [5] . 2016. Symbolic buffer sizing for throughput-optimal scheduling of dataflow graphs. In Real-Time and Embedded Technology and Applications Symposium (RTAS’16). 199–208.Google Scholar
- [6] . 2017. A survey of parametric dataflow models of computation. ACM Trans. Des. Automat. Electron. Syst. 22, 2 (
Mar. 2017).Google ScholarDigital Library
- [7] . 2017. Symbolic analyses of dataflow graphs. ACM Trans. Des. Automat. Electron. Syst. 22, 2 (2017), 39.Google Scholar
Digital Library
- [8] . 1993. Scheduling dynamic data-flow graphs with bounded memory using the token flow model. In International Conference on Acoustics, Speech, and Signal Processing (ICASSP’93). IEEE, 429–432.Google Scholar
- [9] . 2013. PiMM: Parameterized and interfaced dataflow meta-model for MPSoCs runtime reconfiguration. In International Conference on Embedded Computer Systems: Architectures, Modeling, and Simulation (SAMOS’13). IEEE, 41–48.Google Scholar
Cross Ref
- [10] . 2013. PiMM: Parameterized and interfaced dataflow meta-model for MPSoCs runtime reconfiguration. In 13th International Conference on Embedded Computer Systems: Architecture, Modeling and Simulation. 41–48.Google Scholar
Cross Ref
- [11] . 2019. RDF: Reconfigurable dataflow. In Design, Automation & Test in Europe Conference & Exhibition.Google Scholar
Cross Ref
- [12] . 2011. SPDF: A Schedulable Parametric Data-flow MoC (Extended Version).
Research Report RR-7828. INRIA. Retrieved from https://hal.inria.fr/hal-00666284.Google Scholar - [13] . 2012. SPDF: A schedulable parametric data-flow MoC. In Conference on Design, Automation and Test in Europe. 769–774.Google Scholar
Cross Ref
- [14] . 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman.Google Scholar
Digital Library
- [15] . 2010. Synchronous dataflow scenarios. ACM Trans. Embed. Comput. Syst. 10, 2 (2010), 16.Google Scholar
Digital Library
- [16] . 2005. Software-defined radio — Basics and evolution to cognitive radio. EURASIP J. Wirel. Commun. Netw. 3 (2005), 275–283.Google Scholar
- [17] . 1974. The semantics of a simple language for parallel programming. Inf. Process. 74 (1974), 471–475.Google Scholar
- [18] . 2014. System Design, Modeling, and Simulation using Ptolemy II. Ptolemy.org.Google Scholar
- [19] . 1987. Synchronous data flow. Proc. IEEE 75, 9 (1987), 1235–1245.Google Scholar
Cross Ref
- [20] . 2008. Improved net rewriting systems-extended Petri nets supporting dynamic changes. J. Circ. Syst. Comput. 17, 6 (2008), 1027–1052.Google Scholar
Cross Ref
- [21] . 2010. Buffer sizing for rate-optimal single-rate data-flow scheduling revisited. IEEE Trans. Comput. 59, 2 (2010), 188–201.Google Scholar
Digital Library
- [22] . 2018. Overview of reconfigurable Petri nets. In Graph Transformation, Specifications, and Nets - In Memory of Hartmut Ehrig, Reiko Heckel and Gabriele Taentzer (Eds.). Lecture Notes in Computer Science, 201–222.Google Scholar
- [23] . 2016. Model checking reconfigurable Petri nets with Maude. In 9th International Conference on Graph Transformation (ICGT’16). 54–70.Google Scholar
Cross Ref
- [24] . 1994. Set-theoretic graph rewriting. In Graph Transformations in Computer Science. Springer, 312–325.Google Scholar
Cross Ref
- [25] . 2021. RDF: A Reconfigurable Dataflow Model of Computation. Ph. D. Dissertation. Université Grenoble Alpes.Google Scholar
- [26] . 2015. Parametrized dataflow scenarios. In 12th International Conference on Embedded Software. 95–104.Google Scholar
Digital Library
- [27] . 2008. Buffer capacity computation for throughput constrained streaming applications with data-dependent inter-task communication. In IEEE Real-time and Embedded Technology and Applications Symposium. 183–194.Google Scholar
Index Terms
RDF: A Reconfigurable Dataflow Model of Computation
Recommendations
Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets
Special Issue on Real-Time and Embedded Technology and Applications, Domain-Specific Multicore Computing, Cross-Layer Dependable Embedded Systems, and Application of Concurrency to System Design (ACSD'13)Join-Free Petri nets, whose transitions have at most one input place, model systems without synchronizations, while Choice-Free Petri nets, whose places have at most one output transition, model systems without conflicts. These classes respectively ...
A comparison of synchronous and cycle-static dataflow
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)We compare synchronous dataflow (SDF) and cyclo-static dataflow (CSDF), which are each special cases of a model of computation we call dataflow process networks. In SDF actors have static firing rules: they consume and produce a fixed number of data ...
An automated process for compiling dataflow graphs into reconfigurable hardware
Special issue on low power electronics and designWe describe a system, developed as part of the Cameron project, which compiles programs written in a single-assignment subset of C called SA-C into dataflow graphs and then into VHDL. The primary application domain is image processing. The system ...






Comments