Efficient exact Boolean schedulability tests for fixed priority preemption threshold scheduling

Abstract Fixed priority preemption threshold scheduling (PTS) is effective in scalable real-time system design, which requires system tuning processes, where the performance of schedulability tests for PTS matters much. This paper proposes five methods for efficient exact Boolean schedulability tests for PTS, which returns the Boolean result that tells whether the given task is schedulable or not. We regard the sufficient test for fully preemptive fixed priority scheduling (FPS) and the early exit in the response time calculations as the conventional approach. We propose (1) a new sufficient test, (2) new initial values for the start/finish times, (3) pre-calculation of the interference time within the start time, (4) incremental start/finish time calculation, and (5) early exits in start/finish time calculations. These are based on some previous work for FPS. The new initial start time, pre-calculation, and the incremental calculations also can be used for the exact response time analysis for PTS. Our empirical results show that the overall proposed methods reduce the iteration count/run time of the conventional test by about 60%/40%, regardless of the number of tasks and the total utilization.

[1]  Sanjoy K. Baruah,et al.  A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines , 2009, IEEE Transactions on Computers.

[2]  Andy J. Wellings,et al.  Applying fixed‐priority preemptive scheduling with preemption threshold to asynchronous event handling in the RTSJ , 2011, Concurr. Comput. Pract. Exp..

[3]  Alan Burns,et al.  Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems , 2008, IEEE Transactions on Computers.

[4]  Tei-Wei Kuo,et al.  A faster exact schedulability analysis for fixed-priority scheduling , 2006, J. Syst. Softw..

[5]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

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

[7]  Johan J. Lukkien,et al.  Improved feasibility of fixed-priority scheduling with deferred preemption using preemption thresholds for preemption points , 2013, RTNS '13.

[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]  Albert Y. Zomaya,et al.  Lowest priority first based feasibility analysis of real-time systems , 2013, J. Parallel Distributed Comput..

[10]  Wei-Kuan Shih,et al.  Period-Dependent Initial Values for Exact Schedulability Test of Rate Monotonic Systems , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[11]  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).

[12]  Yunwei Dong,et al.  Energy-Efficient Task Scheduling and Task Energy Consumption Analysis for Real-Time Embedded Systems , 2014, 2014 Theoretical Aspects of Software Engineering Conference.

[13]  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).

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

[15]  Konstantinos Bletsas,et al.  Optimal priority assignment in the presence of blocking , 2006, Inf. Process. Lett..

[16]  Liu Yang,et al.  On-Line and Off-Line DVS for Fixed Priority with Preemption Threshold Scheduling , 2009, 2009 International Conference on Embedded Software and Systems.

[17]  Alan Burns,et al.  Optimal (D-J)-monotonic priority assignment , 2007, Inf. Process. Lett..

[18]  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..

[19]  Zonghua Gu,et al.  PT-AMC: Integrating Preemption Thresholds into Mixed-Criticality Scheduling , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[20]  Robert I. Davis,et al.  Integrating Cache-Related Pre-Emption Delays into Analysis of Fixed Priority Scheduling with Pre-Emption Thresholds , 2014, 2014 IEEE Real-Time Systems Symposium.

[21]  Saehwa Kim.  Dual ceiling protocol for real-time synchronization under preemption threshold scheduling , 2010, J. Comput. Syst. Sci..

[22]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[23]  Peter A. Buhr,et al.  Solution space for fixed-priority with preemption threshold , 2005, 11th IEEE Real Time and Embedded Technology and Applications Symposium.

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

[25]  Reinder J. Bril,et al.  Optimal priority and threshold assignment for fixed-priority preemption threshold scheduling , 2018, SIGBED.

[26]  Saehwa Kim.  Assigning Priorities for Fixed Priority Preemption Threshold Scheduling , 2015, TheScientificWorldJournal.

[27]  Robert I. Davis,et al.  Optimal Fixed Priority Scheduling with Deferred Pre-emption , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

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

[29]  Sebastian Altmeyer,et al.  Schedulability using native non-preemptive groups on an AUTOSAR/OSEK platform with caches , 2017, Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017.

[30]  Qi Zhu,et al.  Minimizing Stack and Communication Memory Usage in Real-Time Embedded Applications , 2014, TECS.

[31]  Saehwa Kim.  Synthesizing Multithreaded Code from Real-Time Object-Oriented Models via Schedulability-Aware Thread Derivation , 2014, IEEE Transactions on Software Engineering.

[32]  Saehwa Kim.  Efficient Optimal Priority Assignment for Fixed Priority Preemption Threshold Scheduling , 2018, J. Inf. Sci. Eng..

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

[34]  Giorgio C. Buttazzo,et al.  Limited Preemptive Scheduling for Real-Time Systems. A Survey , 2013, IEEE Transactions on Industrial Informatics.