Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/3343414.3343427acmconferencesArticle/Chapter ViewAbstractPublication PagesmemocodeConference Proceedingsconference-collections
research-article

Specification of precise timing in synchronous dataflow models

Published: 18 November 2016 Publication History

Abstract

This paper proposes an extension to dataflow models with timing specifications to facilitate the construction of deterministic, platform independent, precisely timed models of software in cyber-physical systems (CPS). Dataflow models are often used to describe the software/cyber part of a CPS, owing to their succinct and analyzable representation of computation and concurrency. To capture the interaction of the cyber with the physical part, it is common practice to augment the dataflow model with nodes to represent physical sensors and actuators and handle the timing outside the dataflow model. However, the precise timing of these interactions is critical to the overall application behavior, and conventional dataflow models do not capture these timing requirements. In this work, we introduce timing configurations in dataflow models to specify when this communication between cyber and physical parts takes place. Timing specifications are derived from application requirements which are independent of the platform execution behavior. A correct implementation must fulfill the dataflow and timing requirements. This paper discusses the extension of the well-studied Synchronous Dataflow (SDF) model with timing configurations, shows how traditional SDF analysis for consistency and deadlock freedom is adapted for this model, and discusses hierarchical composition and analysis of composite SDF nodes with timing configurations. We believe that a model for the cyber part of a CPS must allow for the specification of application timing behavior as an integral part of the model. Timing extensions for dataflow models accomplish this in a natural and comprehensible manner. By illustrating timing configurations for SDF, we lay the groundwork for their application to a variety of dataflow models.

References

[1]
IEEE standard for local and metropolitan area networks timing and synchronization for time-sensitive applications in bridged local area networks corrigendum 1: Technical and editorial corrections. IEEE Std 802.1AS-2011/Cor 1--2013, Sept 2013.
[2]
A. Benveniste and P. Le Guernic. Hybrid dynamical systems theory and the SIGNAL language. IEEE Transactions on Automatic Control, 35(5):525--546, 1990.
[3]
S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee. Software Synthesis from Dataflow Graphs. Kluwer Academic Publishers, Norwell, Mass, 1996.
[4]
A. Bouakaz and T. Gautier. An abstraction-refinement framework for priority-driven scheduling of static dataflow graphs. In Formal Methods and Models for Codesign (MEMOCODE), 2014 Twelfth ACM/IEEE International Conference on, pages 2--11, Oct 2014.
[5]
F. Boussinot and R. De Simone. The ESTEREL language. Proceedings of the IEEE, 79(9), 1991.
[6]
J. T. Buck and E. A. Lee. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. In Acoustics, Speech, and Signal Processing, 1993. ICASSP-93., 1993 IEEE International Conference on, volume 1, pages 429--432 vol.1, April 1993.
[7]
J. B. Dennis. First version data flow procedure language. Technical Report MAC TM61, MIT Laboratory for Computer Science, 1974.
[8]
J. C. Eidson. Measurement, Control, and Communication Using IEEE 1588. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
[9]
J. Falk, J. Keinert, C. Haubelt, J. Teich, and S. S. Bhattacharyya. A generalized static data flow clustering algorithm for MPSoC scheduling of multimedia applications. In Proceedings of the 8th ACM International Conference on Embedded Software, EMSOFT '08, pages 189--198, New York, NY, USA, 2008. ACM.
[10]
M. Geilen, T. Basten, and S. Stuijk. Minimising buffer requirements of synchronous dataflow graphs with model checking. In DAC, pages 819--824, Anaheim, California, USA, 2005. ACM.
[11]
A. H. Ghamarian, M. C. W. Geilen, S. Stuijk, T. Basten, B. D. Theelen, M. R. Mousavi, A. J. M. Moonen, and M. J. G. Bekooij. Throughput analysis of synchronous data flow graphs. In Proceedings of the Sixth International Conference on Application of Concurrency to System Design, ACSD '06, pages 25--36, Washington, DC, USA, 2006. IEEE Computer Society.
[12]
R. Govindarajan and G. R. Gao. Rate-optimal schedule for multi-rate DSP computations. J. VLSI Signal Process. Syst., 9(3):211--232, 1995.
[13]
N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous data flow programming language LUSTRE. Proceedings of the IEEE, 79(9), 1991.
[14]
T. A. Henzinger, B. Horowitz, and C. M. Kirsch. Giotto: A time-triggered language for embedded programming. Proceedings of IEEE, 91(1):84--99, 2003.
[15]
G. Kahn. The semantics of a simple language for parallel programming. In Proc. of the IFIP Congress 74, pages 471--475. North-Holland Publishing Co., 1974.
[16]
J. P. Katoen and H. Wu. Exponentially timed SADF: Compositional semantics, reductions, and analysis. In Embedded Software (EMSOFT), 2014 International Conference on, pages 1--10, Oct 2014.
[17]
J. Kodosky, J. MacCrisken, and G. Rymar. Visual programming using structured data flow. In IEEE Workshop on Visual Languages, pages 34--39, Kobe, Japan, 1991. IEEE Computer Society Press.
[18]
H. Kopetz and G. Bauer. The time-triggered architecture. Proceedings of the IEEE, 91(1):112--126, 2003.
[19]
P. Le Guernic, T. Gauthier, M. Le Borgne, and C. Le Maire. Programming real-time applications with SIGNAL. Proceedings of the IEEE, 79(9), 1991.
[20]
E. A. Lee and D. G. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Transactions on Computers, C-36(1):24--35, 1987.
[21]
E. A. Lee and D. G. Messerschmitt. Synchronous data flow. Proceedings of the IEEE, 75(9), 1987.
[22]
O. M. Moreira and M. J. G. Bekooij. Self-timed scheduling analysis for real-time applications. EURASIP Journal on Advances in Signal Processing, 2007(1), 2007.
[23]
Object Management Group (OMG). A UML profile for MARTE, beta 2. OMG Adopted Specification ptc/08-06-09, OMG, August 2008.
[24]
M.-A. Peraldi-Frati, H. Blom, D. Karlsson, and S. Kuntz. Timing modeling with AUTOSAR: Current state and future directions. In Proceedings of Design, Automation and Test in Europe (DATE '12), pages 805--809, San Jose, CA, USA, 2012.
[25]
J. L. Pino, S. Bhattacharyya, and E. Lee. Hierarchical multiprocessor scheduling framework for synchronous dataflow graphs. Technical Report Technical Report UCB/ERL M95/36, EECS Department, University of California, Berkeley, 1995.
[26]
J. L. Pino and K. Kalbasi. Cosimulating synchronous DSP applications with analog RF circuits. In Thirty-Second Annual Asilomar Conference on Signals, Systems, and Computers, November 1998.
[27]
C. Ptolemaeus, editor. System Design, Modeling, and Simulation using Ptolemy II. Ptolemy.org, Berkeley, CA, 2014.
[28]
G. C. Sih and E. A. Lee. A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Transactions on Parallel and Distributed Systems, 4(2):175--187, 1993.
[29]
S. Sriram and S. S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. CRC press, 2nd edition, 2009.
[30]
S. Stuijk, M. Geilen, and T. Basten. SDF<sup>3</sup>: SDF For Free. In Application of Concurrency to System Design, 6th International Conference, ACSD 2006, Proceedings, pages 276--278. IEEE Computer Society Press, Los Alamitos, CA, USA, June 2006.
[31]
S. Stuijk, M. C. Geilen, and T. Basten. Throughput-buffering tradeoff exploration for cyclo-static and synchronous dataflow graphs. IEEE Transactions on Computers, 57(10):1331--1345, 2008.
[32]
J. Symanzik and A. L. Baker. Timed data flow diagrams. Technical Report Technical Report 96-12, Iowa State University, Department of Computer Science, 226 Atanaso Hall, Ames, Iowa 50011, October 1996.
[33]
S. Tripakis, D. Bui, M. Geilen, B. Rodiers, and E. A. Lee. Compositionality in synchronous data flow: Modular code generation from hierarchical SDF graphs. Technical Report UCB/EECS-2010-52, EECS Department, University of California, Berkeley, May 7 2010.
[34]
R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenstr. The worst-case execution-time problem - overview of methods and survey of tools. ACM TECS, pages 1--53, 2008.
[35]
Y. Zhao, E. A. Lee, and J. Liu. A programming model for time-synchronized distributed real-time systems. In RTAS, Bellevue, WA, USA, 2007. IEEE.
  1. Specification of precise timing in synchronous dataflow models

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MEMOCODE '16: Proceedings of the 14th ACM-IEEE International Conference on Formal Methods and Models for System Design
    November 2016
    196 pages
    ISBN:9781509027910

    Sponsors

    Publisher

    IEEE Press

    Publication History

    Published: 18 November 2016

    Check for updates

    Author Tags

    1. cyber-physical systems (CPS)
    2. dataflow
    3. deterministic
    4. platform independent
    5. synchronous dataflow (SDF)
    6. timing specification

    Qualifiers

    • Research-article

    Conference

    MEMOCODE'16
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 34 of 82 submissions, 41%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 14
      Total Downloads
    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 06 Oct 2024

    Other Metrics

    Citations

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media