Resource minimized static mapping and dynamic scheduling of SDF graphs

2011 9th IEEE Symposium on Embedded Systems for Real-Time Multimedia, ESTIMedia 2011

Volumn , Issue , 2011, Pages 83-92

  Kim, Jinwoo ^a   Shin, Tae Ho ^a   Ha, Soonhoi ^a   Oh, Hyunok ^b  

^a Seoul National University   (South Korea)

^b Hanyang University   (South Korea)

Author keywords

buffer size minimization; dynamic scheduling; Mapping; parallel execution; SDF graph; throughput

Indexed keywords

AVERAGE THROUGHPUT; BUFFER REQUIREMENTS; BUFFER SIZES; DYNAMIC SCHEDULING; MULTI OBJECTIVE EVOLUTIONARY ALGORITHMS; NP COMPLETE; PARALLEL EXECUTIONS; PRIORITY ASSIGNMENT; RUNTIMES; SDF GRAPH; STATIC MAPPING; STATIC SCHEDULING; SYNCHRONOUS DATA FLOW GRAPHS; TASK EXECUTIONS; THROUGHPUT CONSTRAINTS;

DATA FLOW ANALYSIS; EVOLUTIONARY ALGORITHMS; MAPPING; MULTIMEDIA SYSTEMS; PARALLEL PROCESSING SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); THROUGHPUT;

EMBEDDED SYSTEMS;

EID: 83755219411     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ESTIMedia.2011.6088529     Document Type: Conference Paper

References (27)

1. H. Park, H. Oh, and S. Ha, "Multiprocessor SoC design methods and tools," IEEE Signal Processing Magazine, Vol. 26, Issue 6, pp. 72-79, Nov. 2009.
2. th International Conference on Compiler Construction, Grenoble, France, Apr. 2002.
3. E. A. Lee and D. G. Messerschmitt, "Static scheduling of synchronous data flow programs for digital signal processing," IEEE Trans. On Comp., Vol. 36, No. 1., pp. 24-35, 1987.
4. G. Bilsen, M. Engles, R. Lauwereins, and J. A. Peperstraete, "Cyclo-Static Dataflow," IEEE Trans. Signal Processing, 44, 2. pp. 397-408, 1996.
5. E. A. Lee, and S. Ha, "Scheduling Strategies for Multiprocessor Realtime DSP," Proc. of IEEE Global Telecommunications Conference and Exhibition Vol. 2. pp. 1279-1283, Nov. 1989.
6. th Design Automation Conf., June 1998.
7. T. Shin, H. Oh, and S. Ha, "Minimizing Buffer Requirements for Throughput Constrained Parallel Execution of Synchronous Dataflow Graph," ASP-DAC2011, Jan. 2011.
8. H. Yang and S. Ha, "Pipelined Data Parallel Task Mapping/Scheduling Technique for MPSoC," in Proc. of Design Automation and Test in Europe. pp. 69-74, April 2009.
9. S. Stuijk, M. C. W. Geilen, and T. Basten, "Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs," in DAC'06 Proc. pp. 899-904, 2006.
10. A. Dunkels, O. Schmidt, T. Voigt, and M. Ali, "Protothreads: Simplifying Event-Driven Programming of Memory-Constrained Embedded Systems," in Proceedings of the Fourth ACM Conference on SenSys 2006, Boulder, Colorado, USA, Nov. 2006.
11. Henia, R. and et al., "System level performance analysis - the SymTA/S approach," Computers and Digital Techniques, IEE Proceedings. 152, 2. pp. 148-166, Mar. 2005.
12. Wandeler, E, and et al., "System architecture evaluation using modular performance analysis: a case study," International Journal on Software Tools for Technology Transfer (STTT). 8, 6. pp. 649-667, Nov. 2006.
13. S. S. Bhattacharyya, P. K. Murthy, and E. A. Lee, "Software Synthesis from Dataow Graphs," Kluwer Academic Publishers.
14. K. K. Parhi, "Static rate-optimal scheduling of iterative data-flow program via optimum unfoliding," IEEE Trans. on Computers. 40, 2., Feb. 1991.
15. D. J. Wang and Y. H. Hu, "Fully static multiprocessor array realizability criteria for real-time recurrent dsp applications," IEEE Trans. On Signal Processing. 42, 5., May 1994.
16. P. D. Hoang and J. M. Rabaey, "Scheduling of DSP Programs Onto Multiprocessors for Maximum Throughput," IEEE Trans. On Signal Processing, 2225-2235, June 1993.
17. S. Bakshi and D. D. Gajski, "Partitioning and pipelining for performance-constrained hardware/software systems," IEEE Transactions on VLSI Systems. vol. 7, no. 4., pp. 419-432, Dec. 1999.
18. K. S. Chatha and R. Vemuri, "Hardware-software partitioning and pipelined scheduling of transformative applications," IEEE Trans. On VLSI. 10, 30., 2002.
19. L. Benini, D. Bertozzi, A. Guerri, and M. Milano, "Allocation and scheduling for MPSoCs via decomposition and no-good generation," in Proc. of International Joint Conferences on Artificial Intelligence, 2005.
20. V. Suhendra, C. Raghavan, and T. Mitra, "Integrated scratchpad memory optimization and task scheduling for MPSoC architectures," in Proc. of CASES, 2006.
21. M. C. W. Geilen, T. Basten, and S. Stuijk, "Minimizing buffer requirements of synchronous dataflow graphs with model-checking," in Proc. of DAC'05, pp. 819-824, 2005.
22. A. H. Ghamarian, M. C. W. Geilen, S. Stuijk, T. Basten, A. Moonen, M. Bekooij, B. D. Theelen, and M. R. Mousavi, "Throughput analysis of synchronous data flow graphs". in Proc. of ACSD'06 IEEE. pp. 25-34, 2006.
23. Y. Yang, M. Geilen, T. Basten, S. Stuijk, and H. Corporaal, "Exploring Trade-offs between Performance and Resource Requirements for Synchronous Dataflow Graphs," in Estimedia'09 Proc. IEEE, pp. 96-105, 2009.
24. Jun. Zhu, Ingo Sander, and Axel Jantsch, "Pareto Efficient Design for Reconfigurable Streaming Applications on CPU/FPGAs," in Proc. of DATE 2010. pp1035-1040.
25. S. Stuijk, T. Basten, M. C. W. Geilen, and H. Coporaal, "Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs," in Proc. of DAC 2007, pp. 777-782.
26. M. Lukasiewycz and et al. Opt4J - The Meta-heuristic Optimization Framework for Java. http://opt4j.sourceforge.net
27. K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Transactions on Evolutionary Computation, Vol. 6, No. 2, pp. 182-197, 2002.