Feasibility analysis under fixed priority scheduling with limited preemptions

Real-Time Systems

Volumn 47, Issue 3, 2011, Pages 198-223

  Yao, Gang ^a   Buttazzo, Giorgio ^a   Bertogna, Marko ^a  

^a SCUOLA SUPERIORE SANT ANNA   (Italy)

Author keywords

Fixed priority; Limited preemption scheduling; Schedulability analysis

Indexed keywords

ENERGY CONSUMPTION; FEASIBILITY ANALYSIS; FIXED PRIORITIES; FIXED PRIORITY SCHEDULING; LIMITED PREEMPTION SCHEDULING; NON-PREEMPTIVE; PRE-EMPTIVE SCHEDULING; PREEMPTION MODELS; REAL-TIME TASKS; RESPONSE TIME; RESPONSE-TIME ANALYSIS; RUNTIME OVERHEADS; SCHEDULABILITY; SCHEDULABILITY ANALYSIS; SCHEDULABILITY TEST; SIMULATION EXPERIMENTS; WORST-CASE EXECUTION TIME;

COMPUTER SIMULATION; ENERGY UTILIZATION; RESPONSE TIME (COMPUTER SYSTEMS);

EMBEDDED SYSTEMS;

EID: 79956082437     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11241-010-9113-6     Document Type: Article

References (33)

1. Altmeyer S, Gebhard G (2008) Wcet analysis for preemptive scheduling. In: 8th int. workshop on worst-case execution time analysis, Prague, Czech, pp 105-112
2. TP Baker 1991 Stack-based scheduling of real-time processes Real-Time Syst 3 1 67 100 10.1007/BF00365393
3. Baruah S (2005) The limited-preemption uniprocessor scheduling of sporadic systems. In: ECRTS '05: proc. of Euromicro conf. on real-time systems, pp 137-144 (Pubitemid 44458426)
4. Bertogna M, Buttazzo G, Marinoni M, Yao G, Esposito F, Caccamo M (2010) Preemption points placement for sporadic task sets. In: Proceedings of 22nd Euromicro conference on real-time systems (ECRTS'10), Bruxelles, Belgium
5. E Bini GC Buttazzo 2004 Schedulability analysis of periodic fixed priority systems IEEE Trans Comput 53 11 1462 1473 10.1109/TC.2004.103
6. E Bini GC Buttazzo 2005 Measuring the performance of schedulability tests Real-Time Syst 30 1-2 129 154 10.1007/s11241-005-0507-9 1083.68008 (Pubitemid 41310221)
7. Bril R (2004) Specification and compositional verification of real-time systems. PhD thesis, Technische Universiteit Eindhoven (TU/e)
8. R Bril J Lukkien W Verhaegh 2009 Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption Real-Time Syst 42 1-3 63 119 10.1007/s11241-009-9071-z 1185.68106
9. Bril RJ, Lukkien JJ, Verhaegh WFJ (2007) Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred revisited. In: ECRTS '07: proc. of Euromicro conf. on real-time systems, pp 269-279 (Pubitemid 47591706)
10. Burns A (1994) Preemptive priority based scheduling: an appropriate engineering approach. In: Son S (ed) Advances in real-time systems, pp 225-248
11. Burns A, Wellings A (2009) In: Real-time systems and programming languages: ADA, real-time Java and C/real-time POSIX (44th edn.). Addison-Wesley, Reading
12. RI Davis A Burns RJ Bril JJ Lukkien 2007 Controller area network (CAN) schedulability analysis: refuted, revisited and revised Real-Time Syst 35 3 239 272 10.1007/s11241-007-9012-7 (Pubitemid 46223453)
13. G Frederickson 1983 Scheduling unit-time tasks with integer release times and deadlines Inf Process Lett 16 4 171 173 10.1016/0020-0190(83)90117-5 0508.68023 707585 (Pubitemid 13576718)
14. M Garey D Johnson B Simons R Tarjan 1981 Scheduling unit-time tasks with arbitrary release times and deadlines SIAM J Comput 10 2 256 269 10.1137/0210018 0472.68021 615217
15. Gebhard G, Altmeyer S (2007) Optimal task placement to improve cache performance. In: Proc. of the ACM-IEEE int. conf. on embedded software, Salzburg, Austria, pp 259-268 (Pubitemid 351203903)
16. George L, Rivierre N, Spuri M (1996) Preemptive and non-preemptive real-time uniprocessor scheduling. Research report RR-2966, INRIA, France
17. Jeffay K, Stanat D, Martel C (1991) On non-preemptive scheduling of period and sporadic tasks. In: Proc. of real-time systems symposium, pp 129-139
18. E Lawler C Martel 1981 Scheduling periodically occurring tasks on multiple processors Inf Process Lett 12 1 9 12 10.1016/0020-0190(81)90066-1 0454.68018 606286 (Pubitemid 11505351)
19. C-G Lee J Hahn Y-M Seo SL Min R Ha S Hong CY Park M Lee CS Kim 1998 Analysis of cache-related preemption delay in fixed-priority preemptive scheduling IEEE Trans Comput 47 6 700 713 10.1109/12.689649 1630153 (Pubitemid 128740956)
20. Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proc. of the real-time systems symposium, CA, USA, pp 166-171 (Pubitemid 20714278)
21. J Leung J Whitehead 1982 On the complexity of fixed-priority scheduling of periodic real-time tasks Perform Eval 2 4 237 250 10.1016/0166-5316(82)90024- 4 0496.90046 695235 (Pubitemid 13487696)
22. Li C, Ding C, Shen K (2007) Quantifying the cost of context switch. In: Proc. of workshop on experimental computer science, San Diego, California
23. CL Liu JW Layland 1973 Scheduling algorithms for multiprogramming in a hard-real-time environment J ACM 20 1 46 61 10.1145/321738.321743 0265.68013 343898
24. Mok A-L (1983) Fundamental design problems of distributed systems for the hard real-time environment. PhD thesis, MIT, USA
25. Ramaprasad H, Mueller F (2006) Tightening the bounds on feasible preemption points. In: RTSS '06. proc. of 27th real-time systems symposium, pp 212-222 (Pubitemid 351209732)
26. Regehr J (2002) Scheduling tasks with mixed preemption relations for robustness to timing faults. In: Proc. of the 23rd IEEE real-time systems symposium, pp 315-326
27. L Sha R Rajkumar JP Lehoczky 1990 Priority inheritance protocols: an approach to real-time synchronization IEEE Trans Comput 39 9 1175 1185 10.1109/12.57058 1068998
28. JA Stankovic K Ramamritham 1991 The spring kernel: a new paradigm for real-time systems IEEE Softw 8 3 62 72 10.1109/52.88945 (Pubitemid 21662672)
29. Staschulat J, Ernst R (2004) Multiple process execution in cache related preemption delay analysis. In: Proc. of ACM int. conf. on embedded software, Pisa, Italy, pp 278-286 (Pubitemid 41563716)
30. Wang Y, Saksena M (1999) Scheduling fixed-priority tasks with preemption threshold. In: Proc. of conf. on embedded and real-time computing systems and applications, pp 328-335
31. Yao G, Buttazzo G, Bertogna M (2009) Bounding the maximum length of non-preemptive regions under fixed priority scheduling. In: Proceedings of the 16th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2009), Beijing, China, August 24-26, 2009, pp 351-360
32. Yao G, Buttazzo G, Bertogna M (2010) Comparative evaluation of limited preemptive methods. In: Proceedings of the 15th IEEE international conference on emerging technology and factory automation (ETFA10), Bilbao, Spain, September 13-16, 2010.
33. Yao G, Buttazzo G, Bertogna M (2010) Feasibility analysis under fixed priority scheduling with fixed preemption points. In: Proceedings of the 16th IEEE international conference on embedded and real-time computing systems and applications (RTCSA 2010), Macao, China, August 23-25, 2010, pp 71-80