Skip to main content
SpringerLink
Log in

Estimating Latency for Synchronous Dataflow Graphs Using Periodic Schedules

  • Conference paper
  • First Online:
Verification and Evaluation of Computer and Communication Systems (VECoS 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11847))

  • 240 Accesses

Abstract

Synchronous Dataflow Graph (SDFG) is a formal tool widely used to model and analyze the behaviour of systems constrained by timing requirements. It has been successfully used in digital signal processing and manufacturing fields to specify and analyze the performance of embedded and distributed applications. Various performance indicators such as throughput, latency or memory consumption can be evaluated with SDFGs. This paper tackles the latency analysis for SDFG using periodic schedules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    https://github.com/bbodin/turbine.

References

  1. Zhu, X.: Work-in-progress: equivalence of transformations of synchronous data flow graphs. In: 2018 International Conference on Hardware/Software Co-design and System Synthesis (CODES+ISSS), Turin, pp. 1–2 (2018)

    Google Scholar 

  2. Lesparre, Y.: Efficient evaluation of mappings of dataflow applications onto distributed memory architectures. Mobile Computing, University Pierre et Marie Curie - Paris VI (2017). English

    Google Scholar 

  3. Khatib, J., Munier-Kordon, A., Klikpo, E.C., Trabelsi-Colibet, K.: Computing latency of a real-time system modeled by Synchronous Dataflow Graph. In: Proceedings of the 24th International Conference on Real-Time Networks and Systems (RTNS 2016), pp. 87–96. ACM, New York (2016)

    Google Scholar 

  4. Bodin, B., Lesparre, Y., Delosme, J.-M., Munier-Kordon, A.: Fast and efficient dataflow graph generation. In: Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems, pp. 40–49. ACM (2014)

    Google Scholar 

  5. Benabid-Najjar, A., Hanen, C., Marchetti, O., Munier-Kordon, A.: Periodic schedules for bounded timed weighted event graphs. IEEE Trans. Autom. Control 57(5), 1222–1232 (2012)

    Article  MathSciNet  Google Scholar 

  6. Sriram, S., Bhattacharyya, S.S.: Embedded Multiprocessors: Scheduling and Synchronization, 2nd edn. CRC Press, Boca Raton (2009). https://doi.org/10.1201/9781420048025

    Book  Google Scholar 

  7. Marchetti, O., Munier Kordon, A.: A sufficient condition for the liveness of weighted event graphs. Eur. J. Oper. Res. 197(2), 532–540 (2009)

    Article  MathSciNet  Google Scholar 

  8. Ghamarian, A.H., Stuijk, S., Basten, T., Geilen, M.C.W., Theelen, B.D.: Latency minimization for synchronous data flow graphs. In: 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD 2007), Lubeck, pp. 189–196 (2007)

    Google Scholar 

  9. Teruel, E., Chrzastowski-Wachtel, P., Colom, J., Silva, M.: On weighted t-systems. In: Application and Theory of Petri Nets 1992, pp. 348–367 (1992)

    Chapter  Google Scholar 

  10. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  11. Lee, E.A., Messerschmitt, D.G.: Synchronous data flow. Proc. IEEE 75(9), 1235–1245 (1987)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CEA-LIST Saclay, Gif-sur-yvette, France

    Philippe Glanon, Selma Azaiez & Chokri Mraidha

Authors
  1. Philippe Glanon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Selma Azaiez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chokri Mraidha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Philippe Glanon .

Editor information

Editors and Affiliations

  1. IMDEA Software Institute, Pozuelo de Alarcón, Spain

    Pierre Ganty

  2. Laboratory for Analysis and Architecture, Toulouse, France

    Mohamed Kaâniche

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Crown

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Glanon, P., Azaiez, S., Mraidha, C. (2019). Estimating Latency for Synchronous Dataflow Graphs Using Periodic Schedules. In: Ganty, P., Kaâniche, M. (eds) Verification and Evaluation of Computer and Communication Systems. VECoS 2019. Lecture Notes in Computer Science(), vol 11847. Springer, Cham. https://doi.org/10.1007/978-3-030-35092-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-35092-5_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-35091-8

  • Online ISBN: 978-3-030-35092-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation