Abstract
Finite-state machine-based scenario-aware dataflow (FSM-SADF) is a dynamic dataflow model of computation that combines streaming data and finite-state control. For the most part, it preserves the determinism of its underlying synchronous dataflow (SDF) concurrency model and only when necessary introduces the non-deterministic variation in terms of scenarios that are represented by SDF graphs. This puts FSM-SADF in a sweet spot in the trade-off space between expressiveness and analyzability.
However, FSM-SADF supports no notion of compositionality, which hampers its usability in modeling and consequent analysis of large systems.
In this work we propose a compositional semantics for FSM-SADF that overcomes this problem.
We base the semantics of the composition on standard composition of processes with rendezvous communication in the style of CCS or CSP at the control level and the parallel, serial and feedback composition of SDF graphs at the dataflow level.
We evaluate the approach on a case study from the multimedia domain.
- François Baccelli, Guy Cohen, Geert Jan Olsder, and Jean-Pierre Quadrat. 2001. Synchronization and linearity: an algebra for discrete event systems.Google Scholar
- Massimo Bariani, Paolo Lambruschini, and Marco Raggio. 2010. VC- 1 decoder on STMicroelectronics P2012 architecture. In In 8th Intl. Workshop STreaming Day.Google Scholar
- Shuvra S. Battacharyya, Edward A. Lee, and Praveen K. Murthy. 1996. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, Norwell, MA, USA. Google Scholar
Digital Library
- Joseph T. Buck. 1993. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. Ph.D. Dissertation. EECS Department, University of California, Berkeley. Google Scholar
Digital Library
- Christos G Cassandras and Stephane Lafortune. 2009. Introduction to discrete event systems. Springer Science & Business Media. Google Scholar
Digital Library
- S. Gaubert. 1995. Performance evaluation of (max,+) automata. Automatic Control, IEEE Transactions on40, 12 (Dec 1995), 2014-2025.Google Scholar
Cross Ref
- Marc Geilen. 2011. Synchronous Dataflow Scenarios. ACM Trans. Embed. Comput. Syst.10, 2, Article 16 (Jan. 2011), 31 pages. Google Scholar
Digital Library
- Marc Geilen, Joachim Falk, Christian Haubelt, Twan Basten, Bart Theelen, and Sander Stuijk. 2016. Performance Analysis of Weakly-Consistent Scenario-Aware Dataflow Graphs. Journal of Signal Processing Systems(2016), 1-19. Google Scholar
Digital Library
- Marc Geilen and Sander Stuijk. 2010. Worst-case Performance Analysis of Synchronous Dataflow Scenarios. In Proc. of the Eighth IEEE/ACM/IFIP Intl. Conf. on Hardware/Software Codesign and System Synthesis (CODES/ISSS'10). ACM, New York, NY, USA, 125-134. Google Scholar
Digital Library
- Marc Geilen, Stavros Tripakis, and Maarten Wiggers. 2011. The Earlier the Better: A Theory of Timed Actor Interfaces. In Proceedings of the 14th Intl. Conf. on Hybrid Systems: Computation and Control (HSCC '11). ACM, New York, NY, USA, 23-32. Google Scholar
Digital Library
- A. Girault, Bilung Lee, and E. A. Lee. 1999. Hierarchical finite state machines with multiple concurrency models. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems18, 6 (Jun 1999), 742- 760. Google Scholar
Digital Library
- Patrice Godefroid, J Van Leeuwen, J Hartmanis, G Goos, and Pierre Wolper. 1996. Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem. Vol. 1032. Springer Heidelberg. Google Scholar
Digital Library
- C. A. R. Hoare. 1985. Communicating Sequential Processes. Prentice-Hall, Inc., Upper Saddle River, NJ, USA. Google Scholar
Digital Library
- Philip S. Kurtin and Marco J. G. Bekooij. 2017. An Abstraction-Refinement Theory for the Analysis and Design of Real-Time Systems. ACM Trans. Embed. Comput. Syst.16, 5s, Article 173 (Sept. 2017), 20 pages. Google Scholar
Digital Library
- E.A. Lee and D.G. Messerschmitt. 1987. Synchronous data flow. Proc. IEEE 75, 9 (Sept 1987), 1235-1245.Google Scholar
- R. Milner. 1982. A Calculus of Communicating Systems. Springer-Verlag New York, Inc., Secaucus, NJ, USA. Google Scholar
Digital Library
- M. Skelin, M. Geilen, F. Catthoor, and S. Hendseth. 2017. Parameterized DataflowScenarios. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 36, 4 (April 2017), 669-682. Google Scholar
Digital Library
- S. Stuijk, M.C.W. Geilen, and T. Basten. 2006. SDF3: SDF For Free. In Appl. of Concurrency to System Design, 6th Intl. Conf., ACSD 2006, Proc. IEEE Computer Society Press, Los Alamitos, CA, USA, 276-278. Google Scholar
Digital Library
- S. Stuijk, M. Geilen, B. Theelen, and T. Basten. 2011. Scenario-aware dataflow: Modeling, analysis and implementation of dynamic applications. In Embedded Computer Systems (SAMOS), 2011 Intl. Conf. on. 404-411.Google Scholar
- B. van der Sanden, J. Bastos, J. Voeten, M. Geilen, M. Reniers, T. Basten, J. Jacobs, and R. Schiffelers. 2016. Compositional specification of functionality and timing of manufacturing systems. In 2016 Forum on Specification and Design Languages (FDL). 1-8.Google Scholar
Index Terms
Compositionality in scenario-aware dataflow: a rendezvous perspective
Recommendations
Compositionality in scenario-aware dataflow: a rendezvous perspective
LCTES 2018: Proceedings of the 19th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded SystemsFinite-state machine-based scenario-aware dataflow (FSM-SADF) is a dynamic dataflow model of computation that combines streaming data and finite-state control. For the most part, it preserves the determinism of its underlying synchronous dataflow (SDF) ...
It's a matter of time: modeling and analysis of time dependent systems using scenario-aware dataflow
MEMOCODE '18: Proceedings of the 16th ACM-IEEE International Conference on Formal Methods and Models for System DesignFinite-state machine-based scenario-aware dataflow (FSM-SADF) is a dynamic non-deterministic dataflow model of computation that combines streaming data and finite-state control. However, FSM-SADF in its current state cannot be used in applications ...
Worst-Case Throughput Analysis of SDF-Based Parametrized Dataflow
DSD '15: Proceedings of the 2015 Euromicro Conference on Digital System DesignDynamic dataflow models of computation (MoCs) have been introduced to provide designers with enough expressive power to capture increasing levels of dynamism in modern streaming applications. Among dynamic dataflow MoCs, parametrized dataflow MoCs hold ...







Comments