Low-Complexity MPN Preemption Policy for Real-Time Task Scheduling

Preemption plays a vital role in deciding and guaranteeing schedulability of real-time tasks. Over time, many preemption policies have been suggested in the literature ranging from no-preemption, full preemption, limited preemption, and recently a new MPN (mixed preemptive/non-preemptive) preemption policy. Optimal Algorithm (OA) given by Lee et al. for the disallowance of preemption can be further improved for low-time complexity at a little cost of reducing the number of schedulable task sets found. In this work, it is conjectured that if only a certain number of higher density tasks are selected for disallowance of preemption, then time complexity of Optimal Algorithm can be reduced substantially. Accordingly, a new Low-Complexity MPN (LCMPN) is proposed, implemented, and analyzed which has a lower time complexity than Optimal Algorithm. Simulated results of the proposed LCMPN in comparison to the Optimal Algorithm on the tested constrained task sets, justifies our conjecture.

[1]  Sanjoy K. Baruah,et al.  The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors , 2006, Real-Time Systems.

[2]  Kang G. Shin,et al.  Improvement of Real-Time Multi-CoreSchedulability with Forced Non-Preemption , 2014, IEEE Transactions on Parallel and Distributed Systems.

[3]  Giorgio C. Buttazzo,et al.  Preemption Points Placement for Sporadic Task Sets , 2010, 2010 22nd Euromicro Conference on Real-Time Systems.

[4]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[5]  Samarjit Chakraborty,et al.  Accounting for cache-related preemption delay in dynamic priority schedulability analysis , 2007 .

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

[7]  Insup Lee,et al.  Zero-laxity based real-time multiprocessor scheduling , 2011, J. Syst. Softw..

[8]  Wang Yi,et al.  Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling , 2011, J. Syst. Archit..

[9]  Giuseppe Lipari,et al.  Improved schedulability analysis of EDF on multiprocessor platforms , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[10]  Marko Bertogna,et al.  Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms , 2007, RTSS 2007.

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

[12]  Chang-Gun Lee,et al.  Analysis of Cache-Related Preemption Delay in Fixed-Priority Preemtive Scheduling , 1998, IEEE Trans. Computers.

[13]  Sanjoy K. Baruah,et al.  Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

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

[15]  Kang G. Shin,et al.  Preempt a Job or Not in EDF Scheduling of Uniprocessor Systems , 2014, IEEE Transactions on Computers.

[16]  Theodore P. Baker.  Comparison of Empirical Success Rates of Global vs. Partitioned Fixed-Priority and EDF Scheduling for Hard Real Time TR-050601 , 2005 .

[17]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

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

[19]  Pascal Richard,et al.  Complexity of scheduling real-time tasks subjected to cache-related preemption delays , 2015, 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA).

[20]  Chang-Gun Lee,et al.  Bounding Cache-Related Preemption Delay for Real-Time Systems , 2001, IEEE Trans. Software Eng..

[21]  Richard West,et al.  Mutable Protection Domains: Towards a Component-Based System for Dependable and Predictable Computing , 2007, RTSS 2007.

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

[23]  Theodore P. Baker,et al.  A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

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

[25]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[26]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.