A predictable multiprocessor design flow for streaming applications with dynamic behaviour

Proceedings - 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools, DSD 2010

Volumn , Issue , 2010, Pages 548-555

  Stuijk, Sander ^a   Geilen, Marc ^a   Basten, Twan ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b EMBEDDED SYSTEMS INSTITUTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ART DESIGN; COMMUNICATION BANDWIDTH; DESIGN COMPLEXITY; DESIGN FLOWS; DYNAMIC APPLICATIONS; DYNAMIC BEHAVIOURS; MULTI-PROCESSOR PLATFORMS; MULTIPROCESSOR DESIGN; OTHER APPLICATIONS; PREDICTABLE DESIGN; PROCESSING CAPACITIES; RESOURCE REQUIREMENTS; RESOURCE USAGE; RUNTIMES; STREAMING APPLICATIONS; SYNCHRONOUS DATAFLOW GRAPHS;

DATA FLOW ANALYSIS; EMBEDDED SYSTEMS; MAPPING; MOTION PICTURE EXPERTS GROUP STANDARDS; MULTIPROCESSING SYSTEMS; SYSTEMS ANALYSIS; TELECOMMUNICATION SYSTEMS;

DESIGN;

EID: 78649881403     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSD.2010.31     Document Type: Conference Paper

References (23)

1. J. Blazewicz. Modeling and Performance Evaluation of Computer Systems. North-Holland, 1976, ch. Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines.
2. A. Bonfietti, et al. Throughput constraint for synchronous data flow graphs. In CPAIOR 09, Proc. (2009), Springer-Verlag, p. 26-40.
3. D. Culler, et al. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann Publishers, 1999.
4. O. Gangwal, et al. Dynamic and Robust Streaming In and Between Connected Consumer-Electronics Devices, vol. 3 of Philips Research Book Series. Springer, 2005, ch. Building Predictable Systems on Chip: An Analysis of Guaranteed Communication in the AEthereal Network on Chip, p. 1-36.
5. A. Ghamarian, et al. Throughput analysis of synchronous data flow graphs. In ACSD 06, Proc. (2006), IEEE, p. 25-36.
6. S. Gheorghita, et al. System-scenario-based design of dynamic embedded systems. ACM ToDAES 14, 1 (2009), p. 1-45.
7. S. Ha, et al. Peace: A hardware-software codesign environment for multimedia embedded systems. ACM ToDAES 12, 3 (2007), p. 1-25.
8. M. Hashemi and S. Ghiasi. Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures. ACM TECS 8, 2 (2009), p. 1-35.
9. J. Hu and R. Marculescu. Energy- and performance-aware mapping for regular noc architectures. IEEE TCAD 24, 4 (2005), p. 551-562.
10. K. Kuchcinski. Constraint-driven scheduling and resource assignment. ACM ToDAES 8, 3 (2003), p. 355-383.
11. E. Lee and D. Messerschmitt. Static scheduling of synchronous data flow programs for digital signal processing. IEEE Trans. on Comp. 36, 1, p. 24-35.
12. W. Liu, et al. Efficient SAT-based mapping and scheduling of homogeneous synchronous dataflow graphs for throughput optimization. In RTSS 08, Proc. (2008), IEEE, p. 492-504.
13. A. Moonen, et al. Timing analysis model for network based multiprocessor systems. In ProRISC 04, Proc. (2004), STW, p. 91-99.
14. O. Moreira, et al. Multiprocessor resource allocation for hard-real-time streaming with a dynamic job-mix. In RTAS 05, Proc., IEEE, p. 332-341.
15. O. Moreira, et al. Scheduling multiple independent hard-real-time jobs on a heterogeneous multiprocessor. In EMSOFT 07, Proc., ACM, p. 57-66.
16. A. Sangiovanni-Vincentelli and G. Martin. Platform-based design and software design methodology for embedded systems. IEEE Design and Test of Computers 18, 6 (2001), p. 23-33. (Pubitemid 33137995)
17. H. Shojaei, A.H. Ghamarian, T. Basten, M.C.W. Geilen, S. Stuijk and R. Hoes. A parameterized compositional multi-dimensional multiple-choice knapsack heuristic for CMP run-time management. In DAC 09, Proc. (2009), ACM, p. 917-922.
18. S. Sriram and S. Bhattacharyya. Embedded Multiprocessors: Scheduling and Synchronization. Marcel Dekker, 2000.
19. 3 is available via www.es.ele.tue.nl/sdf3.
20. S. Stuijk, T. Basten, M.C.W. Geilen and H. Corporaal. Multiprocessor resource allocation for throughput- constrained synchronous dataflow graphs. In DAC 07, Proc., ACM, p. 777-782.
21. S. Stuijk, M.C.W. Geilen and T. Basten. Throughput-buffering trade-off exploration for cyclo-static and synchronous dataflow graphs. IEEE Transactions on Computers, 57(10):1331-1345, 2008.
22. B. Theelen, M.C.W. Geilen, T. Basten, J.P.M. Voeten, S.V. Gheorghita and S. Stuijk. A scenario-aware data flow model for combined long-run average and worst-case performance analysis. In MEMOCODE 06, Proc. (2006), IEEE, p. 185-194.
23. Ch. Ykman-Couvreur, et al. Fast Multi-Dimension Multi-Choice Knapsack Heuristic for MP-SoC Run-Time Management. In Int. Symp. on SoC, Proc. (2006), IEEE, p. 1-4.