Demand-Based Scheduling of Mixed-Criticality Sporadic Tasks on One Processor

Strategies that artificially tighten high-criticality task deadlines in low-criticality behaviors have been successfully employed for scheduling mixed-criticality systems. Although efficient scheduling algorithms have been developed for implicit deadline task systems, the same is not true for more general sporadic tasks. In this paper we develop a new demand-based schedulability test for such general mixed-criticality task systems, in which we collectively bound the low- and high-criticality demand of tasks. We show that the new test strictly dominates the only other known demand-based test for such systems. We also propose a new deadline tightening strategy based on this test, and show through simulations that the strategy significantly outperforms all known scheduling algorithms for a variety of sporadic task systems.

[1]  Wang Yi,et al.  Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[2]  Neil Audsley,et al.  OPTIMAL PRIORITY ASSIGNMENT AND FEASIBILITY OF STATIC PRIORITY TASKS WITH ARBITRARY START TIMES , 2007 .

[3]  Sanjoy K. Baruah,et al.  Mixed-Criticality Scheduling of Sporadic Task Systems , 2011, ESA.

[4]  Sanjoy K. Baruah,et al.  An Algorithm for Scheduling Certifiable Mixed-Criticality Sporadic Task Systems , 2010, 2010 31st IEEE Real-Time Systems Symposium.

[5]  Alan Burns,et al.  Implementing Mixed Criticality Systems in Ada , 2011, Ada-Europe.

[6]  Sanjoy K. Baruah,et al.  Scheduling Real-Time Mixed-Criticality Jobs , 2010, IEEE Transactions on Computers.

[7]  Wang Yi,et al.  Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[8]  Jakob Engblom,et al.  The worst-case execution-time problem—overview of methods and survey of tools , 2008, TECS.

[9]  Steve Vestal,et al.  Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[10]  Sanjoy Baruah,et al.  Scheduling Mixed-Criticality Workloads Upon Unreliable Processors , 2012 .

[11]  Nuno Pereira,et al.  Static-Priority Scheduling over Wireless Networks with Multiple Broadcast Domains , 2007, RTSS 2007.

[12]  Sanjoy K. Baruah,et al.  Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications , 2008, 2008 Euromicro Conference on Real-Time Systems.

[13]  Giorgio C. Buttazzo,et al.  Rate Monotonic vs. EDF: Judgment Day , 2003, Real-Time Systems.

[14]  Alan Burns,et al.  Response-Time Analysis for Mixed Criticality Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

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

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