Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited information about the future job release patterns of a set of non-preemptive tasks, called LCEDF. We then derive its schedulability analysis that provides timing guarantees of the non-preemptive task set on a symmetry multiprocessor platform. Via simulations, we demonstrate the proposed schedulability analysis for LCEDF significantly improves the schedulability performance in meeting timing constraints of a set of non-preemptive tasks up to 20.16%, compared to vanilla non-preemptive EDF.

[1]  Kang G. Shin,et al.  Controlling Preemption for Better Schedulability in Multi-Core Systems , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

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

[3]  Theodore P. Baker,et al.  An analysis of EDF schedulability on a multiprocessor , 2005, IEEE Transactions on Parallel and Distributed Systems.

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

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

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

[7]  Wang Yi,et al.  New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms , 2008, 2008 Real-Time Systems Symposium.

[8]  Hyeongboo Baek,et al.  Task-Level Re-Execution Framework for Improving Fault Tolerance on Symmetry Multiprocessors , 2019, Symmetry.

[9]  Jinkyu Lee,et al.  Improved Schedulability Analysis Using Carry-In Limitation for Non-Preemptive Fixed-Priority Multiprocessor Scheduling , 2017, IEEE Transactions on Computers.

[10]  Cecilia Ekelin,et al.  Clairvoyant non-preemptive EDF scheduling , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[11]  K. Subramani,et al.  An Analysis of Partially Clairvoyant Scheduling , 2003, J. Math. Model. Algorithms.

[12]  Hyeongboo Baek,et al.  An N-Modular Redundancy Framework Incorporating Response-Time Analysis on Multiprocessor Platforms , 2019, Symmetry.

[13]  Hennadiy Leontyev,et al.  A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees , 2008, 2008 Euromicro Conference on Real-Time Systems.

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

[15]  Björn Andersson,et al.  Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors , 2008, 2008 Real-Time Systems Symposium.

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

[17]  K. Subramani,et al.  A Specification Framework for Real-Time Scheduling , 2002, SOFSEM.

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

[19]  Michele Cirinei,et al.  Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).