Optimal Semi-Partitioned Scheduling in Soft Real-Time Systems

Semi-partitioned real-time scheduling algorithms extend partitioned ones by allowing a (usually small) subset of tasks to migrate. The first such algorithm to be proposed was directed at soft real-time (SRT) sporadic task systems where bounded deadline tardiness is acceptable. That algorithm, called EDF-fm, has the desirable property that migrations are boundary-limited, i.e., they can only occur at job boundaries. However, it is not optimal because per-task utilization restrictions are required. In this paper, a new optimal semi-partitioned scheduling algorithm for SRT sporadic task systems is proposed that eliminates such restrictions. This algorithm, called EDF-os, preserves the boundary-limited property. In overhead-aware schedulability experiments presented herein, EDF-os proved to be better than all other tested alternatives in terms of schedulability in almost all considered scenarios. It also proved capable of ensuring very low tardiness bounds, which were near zero in most considered scenarios.

[1]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[2]  Frank Mueller,et al.  Semi-Partitioned Hard-Real-Time Scheduling under Locked Cache Migration in Multicore Systems , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[3]  Björn Andersson,et al.  Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[4]  Shinpei Kato,et al.  Semi-partitioned Fixed-Priority Scheduling on Multiprocessors , 2009, 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium.

[5]  Arnab Sarkar,et al.  Partition oriented frame based fair scheduler , 2010, J. Parallel Distributed Comput..

[6]  Hennadiy Leontyev,et al.  Generalized tardiness bounds for global multiprocessor scheduling , 2007, Real Time Syst..

[7]  Patrick Meumeu Yomsi,et al.  Semi-Partitioned Hard Real-Time Scheduling with Restricted Migrations upon Identical Multiprocessor Platforms , 2010, ArXiv.

[8]  James H. Anderson,et al.  An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[9]  Shinpei Kato,et al.  Portioned EDF-based scheduling on multiprocessors , 2008, EMSOFT '08.

[10]  Gang Quan,et al.  Harmonic semi-partitioned scheduling for fixed-priority real-time tasks on multi-core platform , 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[11]  Alan Burns,et al.  Partitioned EDF scheduling for multiprocessors using a C=D task splitting scheme , 2011, Real-Time Systems.

[12]  Wang Yi,et al.  Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound , 2010, 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium.

[13]  Shinpei Kato,et al.  Semi-Partitioning Technique for Multiprocessor Real-Time Scheduling ∗ , 2008 .

[14]  James H. Anderson,et al.  Optimal semi-partitioned scheduling in soft real-time systems , 2014, RTCSA.

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

[16]  Björn Andersson,et al.  Notional Processors: An Approach for Multiprocessor Scheduling , 2009, 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium.

[17]  Shinpei Kato,et al.  Real-Time Scheduling with Task Splitting on Multiprocessors , 2007, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007).

[18]  Eduardo Tovar,et al.  The Carousel-EDF scheduling algorithm for multiprocessor systems , 2013, 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications.

[19]  James H. Anderson,et al.  Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling , 2012, Real-Time Systems.

[20]  James H. Anderson,et al.  A Multiprocessor Server-Based Scheduler for Soft Real-Time Tasks with Stochastic Execution Demand , 2011, 2011 IEEE 17th International Conference on Embedded and Real-Time Computing Systems and Applications.

[21]  Andrea Bastoni.  Towards the Integration of Theory and Practice in Multiprocessor Real-Time Scheduling , 2011 .

[22]  James H. Anderson,et al.  Tardiness bounds under global EDF scheduling on a multiprocessor , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[23]  Scott A. Brandt,et al.  RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[24]  Hennadiy Leontyev,et al.  LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[25]  James H. Anderson,et al.  Scheduling and locking in multiprocessor real-time operating systems , 2011 .

[26]  Hennadiy Leontyev,et al.  Tardiness Bounds for FIFO Scheduling on Multiprocessors , 2007, 19th Euromicro Conference on Real-Time Systems (ECRTS'07).

[27]  James H. Anderson,et al.  An EDF-based scheduling algorithm for multiprocessor soft real-time systems , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

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

[29]  James H. Anderson,et al.  Reducing Tardiness under Global Scheduling by Splitting Jobs , 2013, 2013 25th Euromicro Conference on Real-Time Systems.

[30]  James H. Anderson,et al.  Is Semi-Partitioned Scheduling Practical? , 2011, 2011 23rd Euromicro Conference on Real-Time Systems.

[31]  Cécile Belleudy,et al.  A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms , 2012, SAC '12.

[32]  Björn Andersson,et al.  Multiprocessor Scheduling with Few Preemptions , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).

[33]  James H. Anderson,et al.  An EDF-based Restricted-Migration Scheduling Algorithm for Multiprocessor Soft Real-Time Systems ∗ , 2007 .

[34]  Björn B. Brandenburg,et al.  Cache-Related Preemption and Migration Delays : Empirical Approximation and Impact on Schedulability ∗ , 2010 .

[35]  James H. Anderson,et al.  An $\mathsf{EDF}$ -based restricted-migration scheduling algorithm for multiprocessor soft real-time systems , 2008, Real-Time Systems.

[36]  James H. Anderson,et al.  Fair lateness scheduling: reducing maximum lateness in G-EDF-like scheduling , 2013, Real-Time Systems.

[37]  W. Yi,et al.  Fixed-Priority Multiprocessor Scheduling : Beyond Liu & Layland Utilization Bound , 2010 .

[38]  Joël Goossens,et al.  Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations , 2012, RTNS '12.

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

[40]  Hennadiy Leontyev,et al.  Generalized tardiness bounds for global multiprocessor scheduling , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).