Abstract
The Synchronous Dataflow (SDF) model of computation by Lee and Messerschmitt has become popular for modeling concurrent applications on a multiprocessor platform. It is used to obtain a guaranteed, predictable performance. The model, on the other hand, is quite restrictive in its expressivity, making it less applicable to many modern, more dynamic applications. A common technique to deal with dynamic behavior is to consider different scenarios in separation. This analysis is, however, currently limited mainly to sequential applications.
In this article, we present a new analysis approach that allows analysis of synchronous dataflow models across different scenarios of operation. The dataflow graphs corresponding to the different scenarios can be completely different. Execution times, consumption and production rates and the structure of the SDF may change. Our technique allows to derive or prove worst-case performance guarantees of the resulting model and as such extends the model-driven approach to designing predictable systems to significantly more dynamic applications and platforms. The approach is illustrated with three MP3 and MPEG-4 related case studies.
- ARM. Arm7tdmi processor. http://www.arm.com/products/CPUs/ARM7TDMI.html.Google Scholar
- Baccelli, F., Cohen, G., Olsder, G., and JQuadrat, J. P. 1992. Synchronization and Linearity. John Wiley & Sons, New York.Google Scholar
- Bhattacharya, B. and Bhattacharyya, S. 2001. Parameterized dataflow modeling for DSP systems. IEEE Trans. Signal Process. 49, 10, 2408--2421. 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
- Boudec, J. L. and Thiran, P. 2003. Network calculus: A theory of deterministic queuing systems for the Internet. Springer-Verlag, Berlin. 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, EECS Dept., Berkeley, CA. Google Scholar
Digital Library
- Chao, L.-F. and Sha, E. H.-M. 1995. Static scheduling for synthesis of dsp algorithms on various models. J. VLSI Signal Process. Syst. 10, 3, 207--223. Google Scholar
Digital Library
- Cochet-Terransson, J., Gaubert, S., and Gunawardena, J. 1999. A constructive fixed point theorem for min-max functions. Dyn. Stab. Syst. 14, 4, 407--433.Google Scholar
Cross Ref
- Dasdan, A., Irani, S. S., and Gupta, R. K. 1999. Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In Proceedings of the 36th ACM/IEEE Conference on Design Automation (DAC '99). ACM, New York, 37--42. Google Scholar
Digital Library
- Geilen, M. 2009. Reduction techniques for synchronous dataflow graphs. In Proceedings of the 46th Design Automation Conference. ACM, New York. Google Scholar
Digital Library
- Ghamarian, A., Geilen, M., Basten, T., and Stuijk, S. 2008. Parametric throughput analysis of synchronous data flow graphs. In Proceedings of the Design Automation and Test in Europe Conference. ACM, New York, 116--121. Google Scholar
Digital Library
- Ghamarian, A., Geilen, M., Stuijk, S., Basten, T., Moonen, A., Bekooij, M., Theelen, B., and Mousavi, M. 2006. Throughput analysis of synchronous dataflow graphs. In Proceedings of the 6th International Conference on Application of Concurrency to System Design. IEEE, Los Alamitos, CA, 27--30. Google Scholar
Digital Library
- Ghamarian, A. H., Geilen, M. C. W., Basten, T., Theelen, B. D., Mousavi, M. R., and Stuijk, S. 2006. Liveness and boundedness of synchronous dataflow graphs. In Proceedings of the Formal Methods in Computer Aided Design. IEEE, Los Alamitos, CA, 68--75. Google Scholar
Digital Library
- Gheorghita, S., Basten, T., and Corporaal, H. 2006. Application scenarios in streaming- oriented embedded system design. In Proceedings of the 2006 International Symposium on System-on-Chip. IEEE, Los Alamitos, CA, 175--178.Google Scholar
- Girault, A., Lee, B., and Lee, E. 1999. Hierarchical finite state machines with multiple con- currency models. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 18, 6, 742--760. Google Scholar
Digital Library
- Heidergott, B., Olsder, G. J., and van der Woude, J. 2006. Max Plus at Work. Princeton University Press. Princeton, NJ.Google Scholar
- Kahn, G. 1974. The semantics of a simple language for parallel programming. In Proceedings of the Information Processing Congress 74. North-Holland, Amsterdam, Netherlands, 471--475.Google Scholar
- Karp, R. M. and Miller, R. E. 1966. Properties of a model for parallel computations: Determinancy, termination, queueing. SIAM J. Appl. Math. 14, 6, 1390--1411.Google Scholar
Cross Ref
- Käunzli, S., Hamann, A., Ernst, R., and Thiele, L. 2007. Combined approach to system level performance analysis of embedded systems. In Proceedings of the 5th International Conference on Hardware/Software Codesign and System Synthesis. ACM, New York, 63--68. Google Scholar
Digital Library
- Lee, E. and Messerschmitt, D. 1987. Synchronous dataflow. IEEE Proc. 75, 9, 1235--1245.Google Scholar
Cross Ref
- Lee, E. and Sangiovanni-Vincentelli, A. Dec 1998. A framework for comparing models of computation, IEEE Trans Comput. Aided Des. Integr. Circuits Syst. 17, 12, 1217--1229. Google Scholar
Digital Library
- Mamagkakis, S., Soudris, D., and Catthoor, F. 2007. Middleware design optimization of wireless protocols based on the exploitation of dynamic input patterns. In Proceedings of the Conference on Design, Automation and Test in Europe. ACM, New York, 1036--1041. Google Scholar
Digital Library
- Moreira, O. M. and Bekooij, M. J. G. 2007. Self-timed scheduling analysis for real-time applications. EURASIP J. Adv. Sig. Process.Google Scholar
Cross Ref
- Poplavko, P., Basten, T., and van Meerbergen, J. 2007. Execution-time prediction for dynamic streaming applications with task-level parallelism. In Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools. IEEE, Los Alamitos, CA, 228--235. Google Scholar
Digital Library
- Sangiovanni-Vincentelli, A. and Martin, G. 2001. Platform-based design and software design methodology for embedded systems. IEEE Des. Test 18, 6, 23--33. Google Scholar
Digital Library
- Shlien, S. 1994. Guide to mpeg-1 audio standard. IEEE Trans. Broadcast. 40, 4, 206--218.Google Scholar
Cross Ref
- Sriram, S. and Bhattacharyya, S. S. 2000. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, Inc., New York. Google Scholar
Digital Library
- Stefanov, T., Zissulescu, C., Turjan, A., Kienhuis, B., and Deprettere, E. 2004. System design using Kahn process networks: The Compaan/Laura approach. Proceedings of the Conference on Design, Automation and Test in Europe. ACM, New York, 10340. Google Scholar
Digital Library
- Stiliadis, D. and Varma, A. 1998. Latency-rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Trans. Netw. 6, 5, 611--624. Google Scholar
Digital Library
- Stuijk, S., Geilen, M., and Basten, T. 2006. SDF3: SDF for free. In Proceedings of the 6th International Conference on Application of Concurrency to System Design. IEEE, Los Alamitos, CA, 276--278. Google Scholar
Digital Library
- Theelen, B. D., Geilen, M., Basten, T., Voeten, J., Gheorghita, S. V., and Stuijk, S. 2006. A scenario-aware dataflow model for combined long-run average and worst-case performance analysis. In Proceedings of the International Conference on Formal Methods and Models for Co-Design. ACM, New York, 185--194.Google Scholar
- Thiele, L., Chakraborty, S., and Naedele, M. 2000. Real-time calculus for scheduling hard real-time systems. In Proceedings of the International Symposium on Circuits and Systems. IEEE, Los Alamitos, CA, 101--104.Google Scholar
- Wiggers, M., Bekooij, M., and Smit, G. J. M. 2007. Efficient computation of buffer capacities for cyclo-static dataflow graphs. In Proceedings of the Conference on Design Automation. ACM, New York, 658--663. Google Scholar
Digital Library
- Yang, P., Marchal, P., Wong, C., Himpe, S., Catthoor, F., David, P., Vounckx, J., and Lauwereins, R. 2002. Managing dynamic concurrent tasks in embedded real-time multimedia systems. In Proceedings of the 15th International Symposium on System Synthesis. ACM, New York, 112--119. Google Scholar
Digital Library
Index Terms
Synchronous dataflow scenarios
Recommendations
Parametrized dataflow scenarios
EMSOFT '15: Proceedings of the 12th International Conference on Embedded SoftwareThe FSM-based scenario-aware dataflow (FSM-SADF) model of computation has been introduced to facilitate the analysis of dynamic streaming applications. FSM-SADF interprets application's execution as an execution of a sequence of static modes of ...
Real-Time Chain-Structured Synchronous Dataflow: Latency and Data Memory Requirement Formal Determination
ICAS '09: Proceedings of the 2009 Fifth International Conference on Autonomic and Autonomous SystemsWe consider in this paper a Synchronous DataFlow (SDF) scheduling problem in the context of a multimedia real-time application. A SDF is in our context a chain of non-preemptive processing tasks in charge of the treatment of multimedia data blocks, ...
A comparison of synchronous and cycle-static dataflow
ASILOMAR '95: Proceedings of the 29th Asilomar Conference on Signals, Systems and Computers (2-Volume Set)We compare synchronous dataflow (SDF) and cyclo-static dataflow (CSDF), which are each special cases of a model of computation we call dataflow process networks. In SDF actors have static firing rules: they consume and produce a fixed number of data ...






Comments