The Space of Feasible Execution Times for Asynchronous Periodic Task Systems Using Definitive Idle Times

Sensitivity analysis for real-time systems provides efficient methods to determine feasibility conditions in the case of changes in task parameters, such as different WCET values when porting a system to a different platform. The C-space defines the space of execution times for which a system is feasible, which can help system designers to more easily check if a task set is feasible on a set of candidate platforms. This paper extends previous works generalizing the description of the C-space for Earliest Deadline First scheduling to systems with initial task offsets. The feasibility gain offered by offsets is then expressed as the volume ratio between the C-space of an asynchronous system and its corresponding synchronous system when offsets are randomly chosen. The problem requires solving multiple similar instances of the Chinese Remainder Problem, for which an efficient algorithm in this context is provided. We show that even for random offsets, the gain can reach 15%.

[1]  Mathieu Grenier,et al.  Pushing the limits of CAN - scheduling frames with offsets provides a major performance boost , 2008 .

[2]  Sanjoy K. Baruah,et al.  Generalized Multiframe Tasks , 2004, Real-Time Systems.

[3]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Performance evaluation (Print).

[4]  Giuseppe Lipari,et al.  On the Average Complexity of the Processor Demand Analysis for Earliest Deadline Scheduling , 2013 .

[5]  Donald E. Knuth The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

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

[7]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[8]  Giorgio C. Buttazzo,et al.  Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

[9]  Giorgio C. Buttazzo,et al.  Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.

[10]  Ted K. Ralphs,et al.  Integer and Combinatorial Optimization , 2013 .

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

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

[13]  Laurent George,et al.  Characterization of the Space of Feasible Worst-Case Execution Times for Earliest-Deadline-First Scheduling , 2009, J. Aerosp. Comput. Inf. Commun..