Approximating Response Times of Static-Priority Tasks with Release Jitters

We consider static-priority tasks with constraineddeadlines that are subjected to release jitters. We define an approximate worst-case response time analysis and we propose a polynomial time algorithm. For that purpose, we extend the Fully Polynomial Time Approximation Scheme (FPTAS) presented in [2] to take into account release jitters; this feasibility test is then used to define a polynomial time algorithm that computes approximate worst-case response times of tasks. Nevertheless, the approximate worst-case response time values have not be proved to have any bounded error in comparison with worst-case response times.

[1]  Alan Burns,et al.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

[2]  Mikael Sjödin,et al.  Improved response-time analysis calculations , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[3]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[4]  Reinder J. Bril,et al.  Initial values for online response time calculations , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

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

[6]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[7]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines , 2006, J. Embed. Comput..

[8]  Shigemi Aoyagi,et al.  A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic Scheduling , 1998, Real-Time Systems.

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

[10]  Nathan Fisher,et al.  A Polynomial Time Approximation Scheme for Feasibility Analysis in Static Priority Systems , 2005 .

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