skip to main content
research-article

Buffer capacity computation for throughput-constrained modal task graphs

Published:07 January 2011Publication History
Skip Abstract Section

Abstract

Increasingly, stream-processing applications include complex control structures to better adapt to changing conditions in their environment. This adaptivity often results in task execution rates that are dependent on the processed stream. Current approaches to compute buffer capacities that are sufficient to satisfy a throughput constraint have limited applicability in case of data-dependent task execution rates.

In this article, we present a dataflow model that allows tasks to have loops with an unbounded number of iterations. For instances of this dataflow model, we present efficient checks on their validity. Furthermore, we present an efficient algorithm to compute buffer capacities that are sufficient to satisfy a throughput constraint.

This allows to guarantee satisfaction of a throughput constraint over different modes of a stream processing application, such as the synchronization and synchronized modes of a digital radio receiver.

References

  1. Bauer, C., Frink, A., and Kreckel, R. 2002. Introduction to the GiNaC framework for symbolic computation within the C++ programming language. J. Symbolic Comput. 33, 1--12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bertsimas, D. and Tsitsiklis, J. N. 1997. Introduction to Linear Optimization. Athena Scientific, Nashua, NH. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Bhattacharya, B. and Bhattacharyya, S. S. 2001. Parameterized dataflow modeling for DSP systems. IEEE Trans. Signal Process. 49, 10, 2408--2421. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Bhattacharya, B. and Bhattacharyya, S. S. 2002. Consistency analysis of reconfigurable dataflow specifications. In Embedded Processor Design Challenges. Springer, Berlin, 1--17. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Bilsen, G., Engels, M., Lauwereins, R., and Peperstraete, J. 1996. Cyclo-static dataflow. IEEE Trans. Signal Process. 44, 2, 397--408. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Buck, J. 1993. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. Ph.D. thesis, University of California, Berkeley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms. MIT Press, Cambridge, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Gao, G. R., Govindarajan, R., and Panangaden, P. 1992. Well-behaved dataflow programs for DSP computation. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing. IEEE, Los Alamitos, CA.Google ScholarGoogle Scholar
  9. Girault, A., Lee, B., and Lee, E. A. 1999. Hierarchical finite state machines with multiple concurrency models. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18, 6, 742--760. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Haid, W. and Thiele, L. 2007. Complex task activation schemes in system level performance analysis. In Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis. ACM, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Jersak, M., Richter, K., and Ernst, R. 2005. Performance analysis of complex embedded systems. Int. J. Embedded Syst. 1, 1-2, 33--49.Google ScholarGoogle Scholar
  12. Lee, E. A. 1991. Consistency in Dataflow Graphs. IEEE Trans. Parallel Distrib. Syst. 2, 2, 223--235. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Lee, E. A. and Parks, T. M. 1995. Dataflow process networks. Proc. IEEE 83, 5, 773--801.Google ScholarGoogle Scholar
  14. Maxiaguine, A., Zhu, Y., Chakraborty, S., and Wong, W. 2004. Tuning SoC platforms for multimedia processing: identifying limits and tradeoffs. In Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis. ACM, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Moreira, O. M. and Bekooij, M. J. G. 2007. Self-timed scheduling analysis for real-time applications. EURASIP J. Adv. Signal Process.Google ScholarGoogle Scholar
  16. Neuendorffer, S. and Lee, E. A. 2004. Hierarchical reconfiguration of dataflow models. In Proceedings of the International Conference on Formal Methods and Models for Co-Design. ACM, New York.Google ScholarGoogle Scholar
  17. Pankert, M., Mauss, O., Ritz, S., and Meyr, H. 1994. Dynamic dataflow and control flow in high-level DSP code synthesis. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing. IEEE, Los Alamitos, CA.Google ScholarGoogle Scholar
  18. Sen, M., Bhattacharyya, S. S., Tiehan, L., and Wolf, W. 2005. Modeling Image Processing systems with homogeneous parameterized dataflow graphs. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing. IEEE, Los Alamitos, CA.Google ScholarGoogle Scholar
  19. Stiliadis, D. and Varma, A. 1998. Latency-rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Trans. Networking 6, 5, 611--624. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Stuijk, S., Geilen, M. C. W., and Basten, T. 2008. Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs. IEEE Trans. Comput. 57, 10, 1331--1345. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Wauters, P., Engels, M., Lauwereins, R., and Peperstraete, J. A. 1996. Cyclo-dynamic dataflow. In Proceedings of the Workshop on Parallel and Distributed Processing. IEEE, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Wiggers, M. H., Bekooij, M. J. G., Jansen, P. G., and Smit, G. J. M. 2007. Efficient computation of buffer capacities for cyclo-static real-time systems with back-pressure. In Proceedings of the Real-Time and Embedded Technology and Applications Symposium. IEEE, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Wiggers, M. H., Bekooij, M. J. G., and Smit, G. J. M. 2007a. Efficient computation of buffer capacities for cyclo-static dataflow graphs. In Proceedings of the Design Automation Conference. ACM, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Wiggers, M. H., Bekooij, M. J. G., and Smit, G. J. M. 2007b. Modelling runtime arbitration by latency-rate servers in dataflow graphs. In Proceedings of the International Workshop on Software and Compilers for Embedded Systems. Springer-Verlag, Berlin. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Wiggers, M. H., Bekooij, M. J. G., and Smit, G. J. M. 2008. Buffer capacity computation for throughput constrained streaming applications with data-dependent inter-task communication. In Proceedings of the Real-Time and Embedded Technology and Applications Symposium. IEEE, Los Alamitos, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Buffer capacity computation for throughput-constrained modal task 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!