Abstract
Multimedia applications are becoming increasingly more complex and computation hungry to match consumer demands. The problem is compounded by the extra dimension of multiple applications sharing the same resources. Good modeling is essential for two main reasons: (1) to predict the behaviour of applications on a given hardware without actually synthesizing the system and (2) to synthesize the system after a feasible solution has been identified from the analysis.
In this chapter we see in detail the model requirements we have for designing and analyzing multimedia systems. We discuss various models of computation, in particular so called dataflow models, and choose one that meets our design-requirements. Another factor that plays an important role in multi-application analysis is determining when and where a part of application is to be executed, also known as scheduling. Heuristics and algorithms for scheduling are called schedulers. In this chapter, we classify the schedulers depending on whether mapping, ordering and timing of task execution are determined at design-time or run-time, and highlight two of them most suited for use in multiprocessor multimedia platforms. We also highlight the issue of composability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bambha, N., Kianzad, V., Khandelia, M., Bhattacharyya, S.S.: Intermediate representations for design automation of multiprocessor DSP systems. Des. Autom. Embed. Syst. 7(4), 307–323 (2002). doi:10.1023/A:1020307222052
Bekooij, M., Hoes, R., Moreira, O., Poplavko, P., Pastrnak, M., Mesman, B., Mol, J.D., Stuijk, S., Gheorghita, V., van Meerbergen, J.: Dataflow analysis for real-time embedded multiprocessor system design. In: Dynamic and Robust Streaming in and Between Connected Consumer-Electronic Devices, pp. 81–108. Springer, Berlin (2005)
Bilsen, G., Engels, M., Lauwereins, R., Peperstraete, J.: Cycle-static dataflow. IEEE Trans. Signal Process. 44(2), 397–408 (1996). doi:10.1109/78.485935
Buck, J.T., Lee, E.A.: Scheduling dynamic dataflow graphs with bounded memory using the token flow model. In: ICASSP-93, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 1, pp. 429–432 (1993). doi:10.1109/ICASSP.1993.319147
CES: Consumer electronics show (2009). Available from: http://www.cesweb.org/
Dasdan, A.: Experimental analysis of the fastest optimum cycle ratio and mean algorithms. ACM Trans. Des. Autom. Electron. Syst. 9(4), 385–418 (2004). doi:10.1145/1027084.1027085
Denolf, K., Bekooij, M., Cockx, J., Verkest, D., Corporaal, H.: Exploiting the expressiveness of cyclo-static dataflow to model multimedia implementations. EURASIP J. Adv. Signal Process. (2007). doi:10.1155/2007/84078
Gao, G.R.: A pipelined code mapping scheme for static data flow computers. Ph.D. thesis, Massachusetts Institute of Technology (1983)
Ghamarian, A.H.: Timing analysis of synchronous data flow graphs. Ph.D. thesis, Eindhoven University of Technology (2008)
Ghamarian, A.H., Geilen, M.C.W., Stuijk, S., Basten, T., Theelen, B.D., Mousavi, M.R., Moonen, A.J.M., Bekooij, M.J.G.: Throughput analysis of synchronous data flow graphs. In: Sixth International Conference on Application of Concurrency to System Design (ACSD), pp. 25–36. IEEE Computer Society, Los Alamitos (2006). doi:10.1109/ACSD.2006.33
Ghamarian, A.H., Geilen, M.C.W., Basten, T., Stuijk, S.: Parametric throughput analysis of synchronous data flow graphs. In: Design Automation and Test in Europe, pp. 116–121. IEEE Computer Society, Los Alamitos (2008). doi:10.1109/DATE.2008.4484672
Hoes, R.: Predictable dynamic behavior in NoC-based MPSoC (2004). Available from: www.es.ele.tue.nl/epicurus/
Kahn, G.: The semantics of a simple language for parallel programming. Inf. Process. 74, 471–475 (1974)
Karp, R.M., Miller, R.E.: Properties of a model for parallel computations: determinancy, termination, queueing. SIAM J. Appl. Math. 14(6), 1390–1411 (1966)
Kopetz, H., Obermaisser, R.: Temporal composability [real-time embedded systems]. Comput. Control Eng. J. 13(4), 156–162 (2002)
Kopetz, H., Suri, N.: Compositional design of RT systems: a conceptual basis for specification of linking interfaces. In: ISORC ’03: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, p. 51. IEEE Computer Society, Washington (2003). doi:10.1109/ISORC.2003.1199236
Lauwereins, R., Wauters, P., Ade, M., Peperstraete, J.A.: Geometric parallelism and cyclo-static data flow in grape-ii. In: Fifth International Workshop on Rapid System Prototyping, 1994, Shortening the Path from Specification to Prototype, Proceedings, pp. 90–107 (1994). doi:10.1109/IWRSP.1994.315905
Lee, E.A.: Consistency in dataflow graphs. IEEE Trans. Parallel Distrib. Syst. 2(2), 223–235 (1991). doi:10.1109/71.89067
Lee, E.A., Ha, S.: Scheduling strategies for multiprocessor real-time DSP. In: GLOBECOM ’89, Global Telecommunications Conference and Exhibition, Communications Technology for the 1990s and Beyond, vol. 2, pp. 1279–1283 (1989). doi:10.1109/GLOCOM.1989.64160
Lee, E.A., Messerschmitt, D.G.: Static scheduling of synchronous dataflow programs for digital signal processing. IEEE Trans. Comput. 36(1), 24–35 (1987)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973). doi:10.1145/321738.321743
Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989). doi:10.1109/5.24143
Oh, H., Ha, S.: Fractional rate dataflow model for efficient code synthesis. J. VLSI Signal Process. 37(1), 41–51 (2004)
Patterson, D.A., Ditzel, D.R.: The case for the reduced instruction set computer. Comput. Archit. News 8(6), 25–33 (1980). doi:10.1145/641914.641917
Petri, C.A.: Kommunikation mit Automaten. Ph.D. thesis, Rheinisch-Westfälisches Institut f. instrumentelle Mathematik an d. Univ. (1962)
Philips: Royal Philips (2009). Available from: www.philips.com
Pino, J.L., Lee, E.A.: Hierarchical static scheduling of dataflow graphs onto multiple processors. In: ICASSP-95, 1995 International Conference on Acoustics, Speech, and Signal Processing, vol. 4, pp. 2643–2646. IEEE, Detroit (1995). doi:10.1109/ICASSP.1995.480104
Samsung: Samsung (2009). Available from: http://www.samsung.com
SDF3: SDF for free [online] (2009). Available at: http://www.es.ele.tue.nl/sdf3/
Sony: World of Sony (2009). Available from: http://www.sony.com
Sriram, S., Bhattacharyya, S.S.: Embedded Multiprocessors; Scheduling and Synchronization. Dekker, New York (2000)
Stuijk, S.: Predictable mapping of streaming applications on multiprocessors. Ph.D. thesis, Eindhoven University of Technology (2007)
Stuijk, S., Geilen, M., Basten, T.: SDF3: SDF for free. In: Sixth International Conference on Application of Concurrency to System Design (ACSD), pp. 276–278. IEEE Computer Society, Los Alamitos (2006a). doi:10.1109/ACSD.2006.23
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). doi:10.1007/3-540-55676-1_20
Theelen, B.D., Geilen, M.C.W., Basten, T., Voeten, J.P.M., Gheorghita, S.V., Stuijk, S.: A scenario-aware data flow 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. IEEE Computer Society Press, Los Alamitos (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Kumar, A., Corporaal, H., Mesman, B., Ha, Y. (2011). Application Modeling and Scheduling. In: Multimedia Multiprocessor Systems. Embedded Systems. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0083-3_2
Download citation
DOI: https://doi.org/10.1007/978-94-007-0083-3_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0082-6
Online ISBN: 978-94-007-0083-3
eBook Packages: EngineeringEngineering (R0)