Estimating Latency for Synchronous Dataflow Graphs Using Periodic Schedules

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11847)


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.


Synchronous dataflow Latency Periodic schedules 


  1. 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. 2.
    Lesparre, Y.: Efficient evaluation of mappings of dataflow applications onto distributed memory architectures. Mobile Computing, University Pierre et Marie Curie - Paris VI (2017). EnglishGoogle Scholar
  3. 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. 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. 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)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Sriram, S., Bhattacharyya, S.S.: Embedded Multiprocessors: Scheduling and Synchronization, 2nd edn. CRC Press, Boca Raton (2009). Scholar
  7. 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)MathSciNetCrossRefGoogle Scholar
  8. 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. 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)CrossRefGoogle Scholar
  10. 10.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  11. 11.
    Lee, E.A., Messerschmitt, D.G.: Synchronous data flow. Proc. IEEE 75(9), 1235–1245 (1987)CrossRefGoogle Scholar

Copyright information

© Crown 2019

Authors and Affiliations

  1. 1.CEA-LIST SaclayGif-sur-yvetteFrance

Personalised recommendations