Minimal Schedulability Testing Interval for Real-Time Periodic Tasks with Arbitrary Release Offsets

The concept of feasibility (or schedulability) interval plays a very important role in the schedulability analysis in real-time systems. Existing results on the schedulability testing interval of real-time task sets under fixed priority scheduling with arbitrary release offsets (or phases) have limitations for certain scenarios in constructing a schedule for testing the schedulability of a given task set. In this paper, we propose a transforming method for deriving minimal schedulability testing interval of real-time n-task sets with arbitrary release offsets under fixed priority scheduling in both the classical pre-emptive model and the Priority-based Functional Reactive Programming (P-FRP) model on uniprocessor. The complexity of our transforming method is O(n), and the validity is also proved by theoretical analysis.

[1]  Walid Taha,et al.  E-FRP with priorities , 2007, EMSOFT '07.

[2]  Alan Burns,et al.  Fixed-priority scheduling of dual-criticality systems , 2013, RTNS '13.

[3]  Albert Mo Kim Cheng,et al.  Feasibility Interval for the Transactional Event Handlers of P-FRP , 2011, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications.

[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.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

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

[7]  Alan Burns,et al.  On Fixed Priority Scheduling, Offsets and Co-Prime Task Periods , 1998, Inf. Process. Lett..

[8]  Giorgio Buttazzo.  Rate Monotonic vs. EDF: Judgment Day , 2003, EMSOFT.

[9]  Emmanuel Grolleau,et al.  Minimal schedulability interval for real-time systems of periodic tasks with offsets , 2004, Theor. Comput. Sci..

[10]  Alan Burns,et al.  A survey of hard real-time scheduling for multiprocessor systems , 2011, CSUR.

[11]  Robert I. Davis.  A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems , 2014, SIGBED.

[12]  Alan Burns,et al.  Fixed priority pre-emptive scheduling: An historical perspective , 1995, Real-Time Systems.

[13]  Paul Hudak,et al.  Functional reactive programming from first principles , 2000, PLDI '00.

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

[15]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..