Schedulability Analysis Using Two Clocks

In classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks arrive and compute with fixed rates periodically. To relax the stringent constraints on task arrival times, we propose to use timed automata to describe task arrival patterns. In a previous work, it is shown that the general schedulability checking problem for such models is a reachability problem for a decidable class of timed automata extended with subtraction. Unfortunately, the number of clocks needed in the analysis is proportional to the maximal number of schedulable task instances associated with a model, which in many cases is huge. In this paper, we show that for fixed priority scheduling strategy, the schedulability checking problem can be solved by reachability analysis on standard timed automata using only two extra clocks in addition to the clocks used in the original model to describe task arrival times. The analysis can be done in a similar manner to response time analysis in classic Rate-Monotonic Scheduling. We believe that this is the optimal solution to the problem, a problem that was suspected undecidable previously. We also extend the result to systems in which the timed automata and the tasks may read and update shared data variables. Then the release time-point of a task may depend on the values of the shared variables, and hence on the time-point at which other tasks finish their exection. We show that this schedulability problem can be encoded as timed automata using n+1 extra clocks, where n is the number of tasks.

[1]  François Laroussinie,et al.  Model-Checking for Hybrid Systems by Quotienting and Constraints Solving , 2000, CAV.

[2]  Kim G. Larsen,et al.  Guided Synthesis of Control Programs Using UPPAAL , 2000, Nord. J. Comput..

[3]  Wang Yi,et al.  Code Synthesis for Timed Automata , 2003 .

[4]  Wang Yi,et al.  TIMES - A Tool for Modelling and Implementation of Embedded Systems , 2002, TACAS.

[5]  James C. Corbett,et al.  Modeling and analysis of real-time Ada tasking programs , 1994, 1994 Proceedings Real-Time Systems Symposium.

[6]  Joseph Sifakis,et al.  Scheduler Modeling Based on the Controller Synthesis Paradigm , 2002, Real-Time Systems.

[7]  Joseph Sifakis,et al.  A framework for scheduler synthesis , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[8]  Michel Poize,et al.  TAXYS: A Tool for the Development and Verification of Real-Time Embedded Systems , 2001, CAV.

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

[10]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[11]  Ansgar Fehnker,et al.  Scheduling a steel plant with timed automata , 1999, Proceedings Sixth International Conference on Real-Time Computing Systems and Applications. RTCSA'99 (Cat. No.PR00306).

[12]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[13]  Wang Yi,et al.  Timed Automata with Asynchronous Processes: Schedulability and Decidability , 2002, TACAS.

[14]  Pravin Varaiya,et al.  Suspension Automata: A Decidable Class of Hybrid Automata , 1994, CAV.

[15]  Oded Maler,et al.  Job-Shop Scheduling Using Timed Automata , 2001, CAV.