skip to main content
research-article

Incremental Analysis of Cyclo-Static Synchronous Dataflow Graphs

Published:08 December 2015Publication History
Skip Abstract Section

Abstract

In this article, we present a mathematical characterisation of admissible schedules of cyclo-static dataflow (csdf) graphs. We demonstrate how algebra ic manipulation of this characterization is related to unfolding csdf actors and how this manipulation allows csdf graphs to be transformed into mrsdf graphs that are equivalent, in the sense that they admit the same set of schedules. The presented transformation allows the rich set of existing analysis techniques for mrsdf graphs to be applied to csdf graphs and generalizes the well-known transformations from csdf and mrsdf into hsdf. Moreover, it gives rise to an incremental approach to the analysis of csdf graphs, where approximate analyses are combined with exact transformations. We show the applicability of this incremental approach by demonstrating its effectiveness on the problem of optimizing buffer sizes under a throughput constraint.

References

  1. Mohamed Benazouz and Alix Munier-Kordon. 2013. Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization. In Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems (M-SCOPES). ACM Press, New York, NY, USA, 3--12. DOI:http://dx.doi.org/10.1145/2463596.2463602 Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete. 1996. Cyclo-Static dataflow. IEEE Transactions on Signal Processing 44, 2 (1996), 397--408. DOI:http://dx.doi.org/10.1109/78.485935 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Guy Cohen, Geert Jan Olsder, and Jean-Pierre Quadrat. 1992. Synchronization and linearity. Wiley New York.Google ScholarGoogle Scholar
  4. Ali Dasdan. 2004. Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Transactions on Design Automation of Electronic Systems (TODAES) 9, 4 (2004), 385--418. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, and Gerard J. M. Smit. 2014a. Multirate equivalents of cyclo-static synchronous dataflow graphs. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD). IEEE. to appear. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, and Gerard J. M. Smit. 2014b. Single-rate approximations of cyclo-static synchronous dataflow graphs. In Proceedings of the 17th International Workshop on Software and Compilers for Embedded Systems. ACM, 11--20. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Robert de Groote, P. K. F. Hölzenspies, Jan Kuper, and H. J. Broersma. 2013. Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. In Proceedings of the 11th ACM-IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE). 35--46.Google ScholarGoogle Scholar
  8. Robert de Groote, Jan Kuper, Hajo Broersma, and Gerard J. M. Smit. 2012. Max-plus algebraic throughput analysis of synchronous dataflow graphs. In Proceedings of the 38th Euromicro Conference on Software Engineering and Advanced Applications (SEAA). IEEE, 29--38. DOI:http://dx.doi.org/10.1109/SEAA.2012.20 Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Marc Geilen. 2009. Reduction techniques for synchronous dataflow graphs. In Proceedings of the 46th ACM/IEEE Design Automation Conference (DAC). IEEE, 911--916. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Marc Geilen. 2010. Synchronous dataflow scenarios. ACM Transactions on Embedded Computing Systems 10, 2 (Dec. 2010), 1--31. DOI:http://dx.doi.org/10.1145/1880050.1880052 Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. H. Ghamarian, M. Geilen, T. Basten, B. Theelen, M. R. Mousavi, and S. Stuijk. 2006a. Liveness and boundedness of synchronous data flow graphs. FMCAD’06 August (2006), 68--75. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 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. 2006b. Throughput analysis of synchronous data flow graphs. In Proceedings of the 6th International Conference on Application of Concurrency to System Design (ACSD). IEEE, 25--36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Soonhoi Ha and Hyunok Oh. 2013. Decidable dataflow models for signal processing: Synchronous dataflow and its extensions. In Handbook of Signal Processing Systems (second edt ed.), Shuvra S. Bhattacharyya, Ed F. Deprettere, Rainer Leupers, and Jarmo Takal (Eds.). Springer, 1083--1109. DOI:http://dx.doi.org/10.1007/978-1-4614-6859-2Google ScholarGoogle Scholar
  14. Joost P. H. M. Hausmans, Stefan J. Geuns, Maarten H. Wiggers, and Marco J. G. Bekooij. 2012. Compositional temporal analysis model for incremental hard real-time system design. In Proceedings of the 10th ACM International Conference on Embedded Software (EMSOFT). ACM Press, New York, NY, USA, 185--194. DOI:http://dx.doi.org/10.1145/2380356.2380390 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. B. Heidergott, Geert Jan Olsder, and Jacob van der Woude. 2006. Max Plus at Work: modeling and analysis of synchronized systems. Princeton University Press.Google ScholarGoogle Scholar
  16. E. A. Lee and D. G. Messerschmitt. 1987. Synchronous data flow. Proc. IEEE 75, 9 (1987), 1235--1245.Google ScholarGoogle ScholarCross RefCross Ref
  17. E. A. Lee and T. M. Parks. 1995. Dataflow process networks. Proc. IEEE 83, 5 (May 1995), 773--801. DOI:http://dx.doi.org/10.1109/5.381846Google ScholarGoogle ScholarCross RefCross Ref
  18. A. Moonen, M. Bekooij, R. van den Berg, and J. van Meerbergen. 2007. Practical and accurate throughput analysis with the cyclo static dataflow model. In Proceedings of the 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS). IEEE, 238--245. DOI:http://dx.doi.org/10.1109/MASCOTS.2007.52 Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. T. M. Parks, J. L. Pino, and E. A. Lee. 1995. A comparison of synchronous and cyclo-static dataflow. In Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers, Vol. 1. IEEE Comput. Soc. Press, 204--210. DOI:http://dx.doi.org/10.1109/ACSSC.1995.540541 Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Raymond Reiter. 1968. Scheduling parallel computations. J. ACM 15, 4 (Oct. 1968), 590--599. DOI:http://dx.doi.org/10.1145/321479.321485 Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Sundararajan Sriram and Shuvra S. Bhattacharyya. 2009. Embedded Multiprocessors: Scheduling and Synchronization. CRC Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Sander Stuijk, Marc Geilen, and Twan Basten. 2006a. Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs. In Proceedings of the 43rd Design Automation Conference (DAC). ACM Press, New York, USA, 899--904. DOI:http://dx.doi.org/10.1145/1146909.1147138 Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Sander Stuijk, Marc Geilen, and Twan Basten. 2008. Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs. IEEE Trans. Comput. 57, 10 (Oct. 2008), 1331--1345. DOI:http://dx.doi.org/10.1109/TC.2008.58 Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Stuijk, M. C. W. Geilen, and T. Basten. 2006b. SDF3: SDF for free. In Application of Concurrency to System Design, 6th International Conference, ACSD 2006, Proceedings. IEEE Computer Society Press, Los Alamitos, CA, USA, 276--278. DOI:http://dx.doi.org/10.1109/ACSD.2006.23 Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. M. H. Wiggers, M. J. G. Bekooij, and G. J. M. Smit. 2007. Efficient computation of buffer capacities for cyclo-static dataflow graphs. In Proceedings of the 44th ACM/IEEE Design Automation Conference (DAC). IEEE, 658--663. DOI:http://dx.doi.org/10.1109/RTAS.2007.12 Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. M. H. Wiggers. 2009. Aperiodic Multiprocessor Scheduling for Real-Time Stream Processing Applications. Ph.D. Dissertation. University of Twente, Enschede, The Netherlands.Google ScholarGoogle Scholar

Index Terms

  1. Incremental Analysis of Cyclo-Static Synchronous Dataflow Graphs

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!