Minimal schedulability interval for real-time systems of periodic tasks with offsets

We consider real-time systems in highly safety context where tasks have to meet strict deadlines. Tasks are periodic, may have offsets, share critical resources and be precedence constrained. Off-line scheduling should be of great help for such systems, but methods proposed in the literature cannot deal with them. Our aim is to extend and improve the well-known cyclicity result of Leung and Merill to every scheduling algorithm and to systems of interacting tasks with offsets. One of the main benefit of our result is to enable the use of off-line scheduling methods for those real-time critical systems.

[1]  Pierre N. Robillard,et al.  Scheduling with earliest start and due date constraints on multiple machines , 1975 .

[2]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

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

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

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

[6]  Kenneth R. Baker,et al.  Sequencing with due-dates and early start times to minimize maximum tardiness , 1974 .

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

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

[9]  Juan Antonio de la Puente,et al.  Automatic Generation of Cyclic Schedules , 1997 .

[10]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

[11]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

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

[13]  Emmanuel Grolleau,et al.  Off-Line Computation of Real-Time Schedules by Means of Petri nets , 2000 .

[14]  Emmanuel Grolleau,et al.  Off-Line Computation of Real-Time Schedules Using Petri Nets , 2002, Discret. Event Dyn. Syst..

[15]  F. Cottet,et al.  Off-line temporal analysis of hard real-time applications , 1994, Proceedings of 2nd IEEE Workshop on Real-Time Applications.

[16]  Jacek Blazewicz,et al.  Scheduling Dependent Tasks with Different Arrival Times to Meet Deadlines , 1976, Performance.

[17]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .