Feasibility Interval for Fixed-Priority Scheduling of Mixed-Criticality Periodic Tasks With Offsets

This letter considers dual-criticality systems having periodic tasks with offsets scheduled by a given fixed-priority scheduler. We are interested to formally derive some feasibility interval for such systems. We prove that such an interval exists and that it is bounded by the size of four hyperperiods plus the largest task offset.

[1]  Liliana Cucu-Grosjean,et al.  Periodicity of real-time schedules for dependent periodic tasks on identical multiprocessor platforms , 2016, Real-Time Systems.

[2]  Sanjoy K. Baruah,et al.  Sustainability in Mixed-Criticality Scheduling , 2017, 2017 IEEE Real-Time Systems Symposium (RTSS).

[3]  Alan Burns,et al.  A Survey of Research into Mixed Criticality Systems , 2017, ACM Comput. Surv..

[4]  Raymond R. Devillers,et al.  The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems , 1997, Real-Time Systems.

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

[6]  Wang Yi,et al.  Bounding and shaping the demand of generalized mixed-criticality sporadic task systems , 2013, Real-Time Systems.

[7]  S. Vestal.  Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance , 2007, RTSS 2007.

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

[9]  Alan Burns,et al.  Sustainable Scheduling Analysis , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[10]  Mehdi Kargahi,et al.  An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems , 2017, Real-Time Systems.

[11]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.