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.
- 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 Scholar
Digital Library
- Bertsimas, D. and Tsitsiklis, J. N. 1997. Introduction to Linear Optimization. Athena Scientific, Nashua, NH. Google Scholar
Digital Library
- Bhattacharya, B. and Bhattacharyya, S. S. 2001. Parameterized dataflow modeling for DSP systems. IEEE Trans. Signal Process. 49, 10, 2408--2421. Google Scholar
Digital Library
- Bhattacharya, B. and Bhattacharyya, S. S. 2002. Consistency analysis of reconfigurable dataflow specifications. In Embedded Processor Design Challenges. Springer, Berlin, 1--17. Google Scholar
Digital Library
- Bilsen, G., Engels, M., Lauwereins, R., and Peperstraete, J. 1996. Cyclo-static dataflow. IEEE Trans. Signal Process. 44, 2, 397--408. Google Scholar
Digital Library
- Buck, J. 1993. Scheduling dynamic dataflow graphs with bounded memory using the token flow model. Ph.D. thesis, University of California, Berkeley. Google Scholar
Digital Library
- Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms. MIT Press, Cambridge, MA. Google Scholar
Digital Library
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- Jersak, M., Richter, K., and Ernst, R. 2005. Performance analysis of complex embedded systems. Int. J. Embedded Syst. 1, 1-2, 33--49.Google Scholar
- Lee, E. A. 1991. Consistency in Dataflow Graphs. IEEE Trans. Parallel Distrib. Syst. 2, 2, 223--235. Google Scholar
Digital Library
- Lee, E. A. and Parks, T. M. 1995. Dataflow process networks. Proc. IEEE 83, 5, 773--801.Google Scholar
- 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 Scholar
Digital Library
- Moreira, O. M. and Bekooij, M. J. G. 2007. Self-timed scheduling analysis for real-time applications. EURASIP J. Adv. Signal Process.Google Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
- 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 Scholar
Digital Library
Index Terms
Buffer capacity computation for throughput-constrained modal task graphs
Recommendations
Buffer Capacity Computation for Throughput Constrained Streaming Applications with Data-Dependent Inter-Task Communication
RTAS '08: Proceedings of the 2008 IEEE Real-Time and Embedded Technology and Applications SymposiumStreaming applications are often implemented as task graphs, in which data is communicated from task to task over buffers. Currently, techniques exist to compute buffer capacities that guarantee satisfaction of the throughput constraint if the amount of ...
Computation of buffer capacities for throughput constrained and data dependent inter-task communication
DATE '08: Proceedings of the conference on Design, automation and test in EuropeStreaming applications are often implemented as task graphs. Currently, techniques exist to derive buffer capacities that guarantee satisfaction of a throughput constraint for task graphs in which the inter-task communication is data-independent, i.e. ...
Efficient computation of buffer capacities for cyclo-static dataflow graphs
DAC '07: Proceedings of the 44th annual Design Automation ConferenceA key step in the design of cyclo-static real-time systems is the determination of buffer capacities. In our multi-processor system, we apply back-pressure, which means that tasks wait for space in output buffers. Consequently buffer capacities affect ...






Comments