Parametric Polynomial-Time Algorithms for Computing Response-Time Bounds for Static-Priority Tasks with Release Jitters

Feasibility analysis algorithms are based on particular metrics such as processor utilization, load factor, processor demand, response-times, etc. The design of efficient algorithms for computing these metrics is a major issue in real-time scheduling theory. In this paper we propose two FPTASs (fully-polynomial time approximation schemes) for checking feasibility of static-priority tasks subjected to release jitters executed upon a uniprocessor platform. We then use these FPTASs for computing two upper bounds of worst-case response-times. Lastly, we show that these bounds do not achieve constant error bounds in comparison with values computed by an exact worst-case response-time analysis (performed in pseudo-polynomial time), and we present numerical experiments.

[1]  Lothar Thiele,et al.  Approximate schedulability analysis , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[2]  Pascal Richard.  Polynomial Time Approximate Schedulability Tests for Fixed-Priority Real-Time Tasks : some numerical experimentations , 2006 .

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

[4]  Ching-Chih Han,et al.  A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms , 1997, Proceedings Real-Time Systems Symposium.

[5]  Rami G. Melhem,et al.  An Improved Rate-Monotonic Admission Control and Its Applications , 2003, IEEE Trans. Computers.

[6]  Enrico Bini,et al.  Efficient computation of response time bounds under fixed-priority scheduling , 2007 .

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

[8]  Dong-Won Park,et al.  A generalized utilization bound test for fixed-priority real-time scheduling , 1995, Proceedings Second International Workshop on Real-Time Computing Systems and Applications.

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

[10]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[11]  Joël Goossens,et al.  Approximating Response Times of Static-Priority Tasks with Release Jitters , 2006 .

[12]  Giorgio C. Buttazzo,et al.  Rate Monotonic Analysis: The Hyperbolic Bound , 2003, IEEE Trans. Computers.

[13]  Frank Slomka,et al.  Efficient feasibility analysis for real-time systems with EDF scheduling , 2005, Design, Automation and Test in Europe.

[14]  Frank Slomka,et al.  An event stream driven approximation for the analysis of real-time systems , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[15]  Tei-Wei Kuo,et al.  Utilization bound revisited , 2003 .

[16]  13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 21-24 August 2007, Daegu, Korea , 2007, RTCSA.

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

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