Real-time partitioned scheduling on multi-core systems with local and global memories

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2013, Pages 467-472

  Chang, Che Wei ^a,b   Chen, Jian Jia ^c   Kuo, Tei Wei ^a,b   Falk, Heiko ^d  

^a RESEARCH CENTER FOR INFORMATION TECHNOLOGY INNOVATION   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^d UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURE DESIGNS; BENCHMARK SUITES; MEMORY RESOURCES; MULTI-CORE SYSTEMS; MULTICORE ARCHITECTURES; POLYNOMIAL-TIME ALGORITHMS; REAL TIME SCHEDULING; REAL-TIME TASKS;

APPROXIMATION ALGORITHMS; BENCHMARKING; COMPUTER AIDED DESIGN; MICROPROCESSOR CHIPS; POLYNOMIAL APPROXIMATION; SCHEDULING;

COMPUTER ARCHITECTURE;

EID: 84877745651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASPDAC.2013.6509640     Document Type: Conference Paper

References (22)

1. AbsInt Angewandte Informatik GmbH. aiT: worst-case execution time analyzers. http://www.absint.com/ait, 2012.
2. Malardalen WCET Research Group. WCET benchmarks. http://www.mrtc.mdh.se/ projects/wcet, 2012.
3. UTDSP Benchmark Suite. http://www.eecg.toronto.edu/?corinna/DSP/ infrastructure/UTDSP.tar.gz, 2012.
4. O. Avissar, R. Barua, and D. Stewart. Heterogeneous memory management for embedded systems. In CASES, 2001.
5. S. Baruah. Partitioning sporadic task systems upon memoryconstrained multiprocessors. to appear in ACM Transactions in Embedded Computing Systems.
6. S. Baruah. The partitioned edf scheduling of sporadic task systems. In RTSS, pages 116-125, 2011.
7. J.-J. Chen and S. Chakraborty. Resource augmentation bounds for approximate demand bound functions. In RTSS, pages 272-281, 2011.
8. J.-J. Chen and S. Chakraborty. Partitioned packing and scheduling for sporadic real-time tasks in identical multiprocessor systems. In ECRTS, pages 24-33, 2012.
9. R. I. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys, 43(4), October 2011.
10. H. Falk and J. C. Kleinsorge. Optimal static WCET-aware scratchpad allocation of program code. In DAC, 2009.
11. N. Fisher, S. Baruah, and T. P. Baker. The partitioned scheduling of sporadic tasks according to static-priorities. In EuroMicro, 2006.
12. M. R. Garey and D. S. Johnson. Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Co., 1979.
13. Y. Guo, Q. Zhuge, J. Hu, M. Qiu, and E. H.-M. Sha. Optimal data allocation for scratch-pad memory on embedded multi-core systems. In ICPP, pages 464-471, 2011.
14. T. Harmon, M. Schoeberl, R. Kirner, R. Klefstad, K. H. Kim, and M. R. Lowry. Fast, interactive worst-case execution time analysis with back-annotation. IEEE Transactions on Industrial Informatics, 8(2):366-377, 2012.
15. C. Lee, M. Potkonjak, andW. H. Mangione-Smith. Mediabench: A tool for evaluating and synthesizing multimedia and communications systems. In MICRO, 1997.
16. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973.
17. G. Memik, W. H. Mangione-Smith, and W. Hu. Netbench: A benchmarking suite for network processors. In ICCAD, 2001.
18. O. Ozturk, M. Kandemir, and I. Kolcu. Shared Scratch-Pad memory space management. In ISQED, 2006.
19. V. Suhendra, T. Mitra, A. Roychoudhury, and T. Chen. WCET centric data allocation to scratchpad memory. In RTSS, pages 223-232, 2005.
20. H. Takase, H. Tomiyama, and H. Takada. Partitioning and allocation of scratch-pad memory for priority-based preemptive multi-task systems. In DATE, pages 1124-1129, 2010.
21. H. Theiling, C. Ferdinand, and R. Wilhelm. Fast and precise WCET prediction by separated cache and path analyses. Real-Time Syst., 18:157-179, May 2000.
22. V. Zivojnovic, J. M. Velarde, C. Schlager, and H. Meyr. DSPstone: A DSP-oriented benchmarking methodology. In ICSPAT, 1994.