Limited Preemptive Scheduling for Real-Time Systems. A Survey

The question whether preemptive algorithms are better than nonpreemptive ones for scheduling a set of real-time tasks has been debated for a long time in the research community. In fact, especially under fixed priority systems, each approach has advantages and disadvantages, and no one dominates the other when both predictability and efficiency have to be taken into account in the system design. Recently, limited preemption models have been proposed as a viable alternative between the two extreme cases of fully preemptive and nonpreemptive scheduling. This paper presents a survey of the existing approaches for reducing preemptions and compares them under different metrics, providing both qualitative and quantitative performance evaluations.

[1]  Manas Saksena,et al.  Scheduling fixed-priority tasks with preemption threshold , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[2]  Giorgio C. Buttazzo,et al.  Feasibility Analysis under Fixed Priority Scheduling with Fixed Preemption Points , 2010, 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications.

[3]  Sebastian Altmeyer,et al.  WCET Analysis for Preemptive Scheduling , 2008, WCET.

[4]  Mathieu Grenier,et al.  Fine-Tuning MAC-Level Protocols for Optimized Real-Time QoS , 2008, IEEE Transactions on Industrial Informatics.

[5]  Sanjoy K. Baruah,et al.  The limited-preemption uniprocessor scheduling of sporadic task systems , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[6]  Marco L. Della Vedova,et al.  Real-Time Modeling for Direct Load Control in Cyber-Physical Power Systems , 2011, IEEE Transactions on Industrial Informatics.

[7]  Manel Velasco,et al.  Performing Flexible Control on Low-Cost Microcontrollers Using a Minimal Real-Time Kernel , 2008, IEEE Transactions on Industrial Informatics.

[8]  Johan J. Lukkien,et al.  Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption , 2007, 19th Euromicro Conference on Real-Time Systems (ECRTS'07).

[9]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[10]  Sanjoy K. Baruah,et al.  Limited Preemption EDF Scheduling of Sporadic Task Systems , 2010, IEEE Transactions on Industrial Informatics.

[11]  Theodore P. Baker,et al.  Stack-based scheduling of realtime processes , 1991, Real-Time Systems.

[12]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[13]  Giorgio C. Buttazzo,et al.  Improving Feasibility of Fixed Priority Tasks Using Non-Preemptive Regions , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[14]  Sebastian Altmeyer,et al.  Optimal task placement to improve cache performance , 2007, EMSOFT '07.

[15]  Michael Short.  Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling , 2011, ETFA2011.

[16]  Anton Cervin,et al.  Comparative Assessment and Evaluation of Jitter Control Methods , 2007 .

[17]  Johan J. Lukkien,et al.  Exact response-time analysis for fixed-priority preemption-threshold scheduling , 2010, 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010).

[18]  Frank Mueller,et al.  Tightening the bounds on feasible preemptions , 2011, TECS.

[19]  Frank Mueller,et al.  Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions , 2008, 2008 IEEE Real-Time and Embedded Technology and Applications Symposium.

[20]  Alan Burns,et al.  Preemptive priority-based scheduling: an appropriate engineering approach , 1995 .

[21]  L. Abeni,et al.  A new kernel approach for modular real-time systems development , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[22]  Sang Lyul Min,et al.  Analysis of cache-related preemption delay in fixed-priority preemptive scheduling , 1998, 17th IEEE Real-Time Systems Symposium.

[23]  Chen Ding,et al.  Quantifying the cost of context switch , 2007, ExpCS '07.

[24]  Robert I. Davis,et al.  Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[25]  Giorgio C. Buttazzo,et al.  Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

[26]  Giorgio C. Buttazzo,et al.  Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.

[27]  Alan Burns,et al.  Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised , 2007, Real-Time Systems.

[28]  Lui Sha,et al.  Impact of Cache Partitioning on Multi-tasking Real Time Embedded Systems , 2008, 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[29]  John Regehr,et al.  Scheduling tasks with mixed preemption relations for robustness to timing faults , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[30]  Frank Mueller,et al.  Tightening the Bounds on Feasible Preemption Points , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[31]  Giorgio C. Buttazzo,et al.  Comparative evaluation of limited preemptive methods , 2010, 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010).

[32]  Giorgio C. Buttazzo,et al.  Optimal Selection of Preemption Points to Minimize Preemption Overhead , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

[33]  Robert I. Davis,et al.  Cache Related Pre-emption Delay Aware Response Time Analysis for Fixed Priority Pre-emptive Systems , 2011, RTSS.

[34]  Johan J. Lukkien,et al.  Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption , 2007, 19th Euromicro Conference on Real-Time Systems (ECRTS'07).

[35]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[36]  Manas Saksena,et al.  Scalable real-time system design using preemption thresholds , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[37]  Giorgio C. Buttazzo,et al.  Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling , 2009, 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.