Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling

Real-Time Systems

Volumn 43, Issue 3, 2009, Pages 211-258

  Davis, Robert I ^a   Rothvo, Thomas ^b   Baruah, Sanjoy K ^c   Burns, Alan ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

^b EPFL   (Switzerland)

^c University of North Carolina   (United States)

Author keywords

Constrained deadline; Earliest Deadline First (EDF); Fixed priority pre emptive scheduling; Implicit deadline; Omega constant; Processor speedup factor; Real time; Sub optimality; Uniprocessor

Indexed keywords

CONSTRAINED DEADLINE; EARLIEST DEADLINE FIRST (EDF); FIXED PRIORITY PRE-EMPTIVE SCHEDULING; IMPLICIT DEADLINE; OMEGA CONSTANT; PROCESSOR SPEEDUP FACTOR; REAL-TIME; SUB-OPTIMALITY; UNIPROCESSOR;

OPTIMIZATION; REAL TIME SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

SCHEDULING ALGORITHMS;

EID: 70349675648     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-009-9079-4     Document Type: Article

References (17)

1. NC Audsley A Burns M Richardson AJ Wellings 1993 Applying new scheduling theory to static priority pre-emptive scheduling Softw Eng J 8 5 284 292
2. Baruah S, Burns A (2006) Sustainable scheduling analysis. In: Proceedings of the IEEE real-time systems symposium, pp 159-168
3. Baruah S, Burns A (2008) Quantifying the sub-optimality of uniprocessor fixed priority scheduling. In: Proceedings of the IEEE international conference on real-time and network systems, pp 89-95
4. SK Baruah LE Rosier RR Howell 1990 Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor Real-Time Systems 2 4 301 324 10.1007/BF01995675
5. Baruah SK, Mok AK, Rosier LE (1990b) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the IEEE real-time system symposium, pp 182-190
6. E Bini GC Buttazzo 2005 Measuring the Performance of Schedulability Tests Real-Time Syst 30 1-2 129 154 1083.68008 10.1007/s11241-005-0507-9 (Pubitemid 41310221)
7. E Bini GC Buttazzo GM Buttazzo 2003 Rate monotonic scheduling: the hyperbolic bound IEEE Trans Comput 52 7 933 942 10.1109/TC.2003.1214341
8. Dertouzos ML (1974) Control robotics: the procedural control of physical processes. In: Proceedings of the IFIP congress, pp 807-813
9. Fineberg MS, Serlin O (1967) Multiprogramming for hybrid computation. In: Proceedings AFIPS fall joint computing conference, pp 1-13
10. M Joseph PK Pandya 1986 Finding response times in a real-time system Comput J 29 5 390 395 10.1093/comjnl/29.5.390 860495
11. Kalyanasundaram B, Pruhs K (1995) Speed is as powerful as clairvoyance. In: Proceedings of the 36th symposium on foundations of computer science, pp 214-221
12. Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: Exact characterization and average case behaviour. In: Proceedings of the IEEE real-time systems symposium, pp 166-171
13. JY-T Leung J Whitehead 1982 On the complexity of fixed-priority scheduling of periodic real-time tasks Perform Eval 2 4 237 250 0496.90046 10.1016/0166-5316(82)90024-4 695235 (Pubitemid 13487696)
14. CL Liu JW Layland 1973 Scheduling algorithms for multiprogramming in a hard-real-time environment J ACM 20 1 46 61 0265.68013 10.1145/321738.321743 343898
15. Mok AK (1983) Fundamental design problems of distributed systems for the hard-real-time environment. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts
16. Sjodin M, Hansson H (1998) Improved response time analysis calculations. In: Proceedings of the 19th IEEE real-time systems symposium, pp 399-408
17. Tindell KW (1994) Fixed priority scheduling of hard real-time systems. PhD thesis, Department of Computr Science, University of York