Feasibility intervals for homogeneous multicores, asynchronous periodic tasks, and FJP schedulers

We address the problem of scheduling asynchronous periodic real-time tasks on homogeneous multicore platforms using a global and Fixed Job-level Priority (FJP) scheduler, e.g., global-EDF (global Earliest Deadline First). We establish a finite interval of time such that, if no task deadline is missed while scheduling only the jobs released within this interval, then no task deadline will ever be missed at run time. This kind of interval is referred to as "feasibility interval" and allows for sufficient and necessary schedulability analyses.

[1]  Jane W.-S. Liu,et al.  Validating timing constraints in multiprocessor and distributed real-time systems , 1994, 14th International Conference on Distributed Computing Systems.

[2]  Frank van Harmelen,et al.  Handbook of Knowledge Representation , 2008, Handbook of Knowledge Representation.

[3]  Matthias Werner,et al.  Genealogy of hard real-time preemptive scheduling algorithms for identical multiprocessors , 2011, Central European Journal of Computer Science.

[4]  Joseph Y.-T. Leung,et al.  A new algorithm for scheduling periodic, real-time tasks , 1989, Algorithmica.

[5]  Bart Selman,et al.  Satisfiability Solvers , 2008, Handbook of Knowledge Representation.

[6]  Joël Goossens,et al.  Scheduling of hard real-time multi-phase multi-thread (MPMT) periodic tasks , 2012, Real-Time Systems.

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

[8]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

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

[10]  Alan Burns,et al.  Sustainability in Real-time Scheduling , 2008, J. Comput. Sci. Eng..

[11]  Theodore P. Baker,et al.  A unified analysis of global EDF and fixed-task-priority schedulability of sporadic task systems on multiprocessors , 2011, J. Embed. Comput..

[12]  Marko Bertogna,et al.  Tests for global EDF schedulability analysis , 2011, J. Syst. Archit..

[13]  Liliana Cucu-Grosjean,et al.  Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms , 2011, J. Syst. Archit..

[14]  Joël Goossens,et al.  Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm , 2012, Real-Time Systems.

[15]  Wang Yi,et al.  New Response Time Bounds for Fixed Priority Multiprocessor Scheduling , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[16]  Kirk Pruhs,et al.  Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks , 2008 .

[17]  Bala Kalyanasundaram,et al.  Errata: A New Algorithm for Scheduling Periodic, Real-Time Tasks , 2000, Algorithmica.