Task set synthesis with cost minimization for sporadic real-time tasks

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2013, Pages 350-359

  Chen, Jian Jia ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

Approximation; Memory allocation; Resource (speed) augmentation; Schedulability analysis; Sporadic real time tasks; Task set synthesis

Indexed keywords

EID: 84894307471     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTSS.2013.42     Document Type: Conference Paper

References (27)

1. AbsInt Angewandte Informatik GmbH. "aiT: worst-case execution time analyzers". In: http://www.absint.com/ait (2012).
2. K. Albers and F. Slomka. "An Event Stream Driven Approximation for the Analysis of Real-Time Systems". In: ECRTS. 2004, pp. 187-195.
3. S. K. Baruah, A. K. Mok, and L. E. Rosier. "Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor". In: IEEE Real-Time Systems Symposium. 1990, pp. 182-190.
4. C.-W. Chang, J.-J. Chen, W. Munawar, T.-W. Kuo, and H. Falk. "Partitioned scheduling for real-time tasks on multiprocessor embedded systems with programmable shared srams". In: EMSOFT. 2012, pp. 153-162.
5. J.-J. Chen and S. Chakraborty. "Partitioned Packing and Scheduling for Sporadic Real-Time Tasks in Identical Multiprocessor Systems". In: ECRTS. 2012, pp. 24-33.
6. J.-J. Chen and S. Chakraborty. "Resource Augmentation Bounds for Approximate Demand Bound Functions". In: RTSS. 2011, pp. 272-281.
7. J.-F. Deverge and I. Puaut. "WCET-Directed Dynamic Scratchpad Memory Allocation of Data". In: ECRTS. 2007, pp. 179-190.
8. F. Eisenbrand and T. Rothvoß. "EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard". In: SODA. 2010, pp. 1029-1034.
9. F. Eisenbrand and T. Rothvoß. "Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard". In: RTSS. 2008, pp. 397-406.
10. H. Falk and J. C. Kleinsorge. "Optimal staticWCET-aware scratchpad allocation of program code". In: DAC. 2009, pp. 732-737.
11. N. Fisher and S. K. Baruah. "A Fully Polynomial-Time Approximation Scheme for Feasibility Analysis in Static-Priority Systems with Arbitrary Relative Deadlines". In: ECRTS. 2005, pp. 117-126.
12. O. H. Ibarra and C. E. Kim. "Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems." In: J. ACM (1975), pp. 463-468.
13. S. Kang and A. G. Dean. "DARTS: Techniques and Tools for Predictably Fast Memory Using Integrated Data Allocation and Real-Time Task Scheduling". In: IEEE Real-Time and Embedded Technology and Applications Symposium. 2010, pp. 333-342.
14. S. Kang and A. G. Dean. "Leveraging both Data Cache and Scratchpad Memory through Synergetic Data Allocation". In: IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). 2012, pp. 119-128.
15. E. L. Lawler. "Fast Approximation Algorithms for Knapsack Problems". In: Math. Oper. Res. 4.4 (1979), pp. 339-356.
16. J. P. Lehoczky, L. Sha, and Y. Ding. "The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior". In: IEEE Real-Time Systems Symposium. 1989, pp. 166-171.
17. J. Y.-T. Leung and J. Whitehead. "On the complexity of fixedpriority scheduling of periodic, real-time tasks". In: Perform. Eval. 2.4 (1982), pp. 237-250.
18. C. L. Liu and J.W. Layland. "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment". In: Journal of the ACM 20.1 (1973), pp. 46-61.
19. A. K. Mok. FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT. Tech. rep. Cambridge, MA, USA, 1983.
20. B. Patt-Shamir and D. Rawitz. "Vector Bin Packing with Multiple-Choice". In: 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT). 2010, pp. 248-259.
21. R. Rajkumar, C. Lee, J. Lehoczky, and D. Siewiorek. "A resource allocation model for QoS management". In: Real-Time Systems Symposium, 1997. Proceedings., The 18th IEEE. 1997, pp. 298-307.
22. S. Rehman, A. Toma, F. Kriebel, M. Shafique, J.-J. Chen, and J. Henkel. "Reliable code generation and execution on unreliable hardware under joint functional and timing reliability considerations". In: IEEE Real-Time and Embedded Technology and Applications Symposium. 2013, pp. 273-282.
23. J. Reineke, D. Grund, C. Berg, and R. Wilhelm. "Timing predictability of cache replacement policies". In: Real-Time Systems 37.2 (2007), pp. 99-122.
24. V. Suhendra, T. Mitra, A. Roychoudhury, and T. Chen. "WCET Centric Data Allocation to Scratchpad Memory". In: RTSS. 2005, pp. 223-232.
25. V. Suhendra, A. Roychoudhury, and T. Mitra. "Scratchpad allocation for concurrent embedded software". In: ACM Trans. Program. Lang. Syst. 32.4 (2010).
26. L. Thiele, S. Chakraborty, and M. Naedele. "Real-time calculus for scheduling hard real-time systems". In: Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on 4 (2000), pp. 101-104.
27. R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, T. Mitra, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenstr̈om. "The worst-case execution-time problem-overview of methods and survey of tools". In: ACM Trans. Embed. Comput. Syst. 7.3 (May 2008), 36:1-36:53. ISSN: 1539-9087.