Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks

Real-Time Systems

Volumn 49, Issue 4, 2013, Pages 475-516

  Chen, Jian Jia ^a   Chakraborty, Samarjit ^b  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Approximate demand bound function; Approximation; DBF; PTAS; Resource augmentation; Schedulability analysis

Indexed keywords

APPROXIMATION; BOUND FUNCTION; DBF; PTAS; RESOURCE AUGMENTATION; SCHEDULABILITY ANALYSIS;

APPROXIMATION ALGORITHMS;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 84878785279     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-013-9181-5     Document Type: Conference Paper

References (21)

1. Albers K, Slomka F (2004) An event stream driven approximation for the analysis of real-time systems. In: ECRTS, pp 187-195
2. Albers K, Slomka F (2005) Efficient feasibility analysis for real-time systems with EDF scheduling. In: DATE, pp 492-497
3. Baruah S (2011) The partitioned EDF scheduling of sporadic task systems. In: Real-time systems symposium (RTSS), pp 116-125
4. Baruah S (2013) Partitioning sporadic task systems upon memory-constrained multiprocessors. ACM Trans Embed Comput Syst 12(3):78
5. Baruah SK, Fisher N (2005) The partitioned multiprocessor scheduling of sporadic task systems. In: RTSS, pp 321-329
6. Baruah SK, Fisher N (2006) The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems. IEEE Trans Comput 55(7):918-923
7. Baruah SK, Mok AK, Rosier LE (1990) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: IEEE real-time systems symposium, pp 182-190
8. Bonifaci V, Wiese A (2012) Scheduling unrelated machines of few different types. In: First interdisciplinary workshop on algorithmic challenges in real-time systems
9. Bonifaci V, Marchetti-Spaccamela A, Stiller S (2008) A constant-approximate feasibility test for multiprocessor real-time scheduling. In: ESA, pp 210-221
10. Bonifaci V, Chan H-L, Marchetti-Spaccamela A, Megow N (2010) Algorithms and complexity for periodic real-time scheduling. In: SODA, pp 1350-1359
11. Chakraborty S, Künzli S, Thiele L (2002) Approximate schedulability analysis. In: IEEE real-time systems symposium, pp 159-168
12. Chekuri C, Khanna S (2004) On multidimensional packing problems. SIAM J Comput 33(4):837-851
13. Davis RI, Burns A (2011) A survey of hard real-time scheduling for multiprocessor systems. ACM Comput Surv 43(4):35
14. Eisenbrand F, RothvoßT (2010) EDF-schedulability of synchronous periodic task systems is coNP-hard. In: SODA, pp 1029-1034
15. Fisher NW (2009) How hard is partitioning for the sporadic task model? In: Proceedings of the 2009 international conference on parallel processing workshops, ICPPW'09, pp 2-5
16. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
17. Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416-429
18. Guan N, Stigge M, Yi W, Yu G (2010) Fixed-priority multiprocessor scheduling with Liu and Layland's utilization bound. In: IEEE real-time and embedded technology and applications symposium, pp 165-174
19. Hochbaum DS, Shmoys DB (1987) Using dual approximation algorithms for scheduling problems theoretical and practical results. J ACM 34(1):144-162
20. Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20(1):46-61
21. Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. Technical report Cambridge, MA, USA