Utilization bound for periodic task set with composite deadline

Due to polynomial time complexity, utilization based tests are desired for online feasibility analysis of periodic task systems. However, the associated disadvantage with these tests is that they propose a bound on system utilization, which trade processor utilization for performance. On the contrary, response time based tests share pseudo-polynomial time complexity, which are very expensive in terms of analysis time and therefore, impractical for analyzing feasibility of online systems. Realizing the advantage of utilization based tests over response time tests, attempts are being made to propose utilization based exact tests that achieve 100% CPU utilization for the system by modifying task parameters such as restricting task periods to be harmonic. We show that in systems where task deadlines are large, better results are obtained by making the task deadlines harmonic. The paper proposes a novel solution to feasibility problem of periodic task system under the assumption of composite deadline by providing a utilization based exact test with an upper bound of 1 and complexity O(n).

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

[2]  Frank Mueller,et al.  Feedback EDF scheduling exploiting dynamic voltage scaling , 2004, Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004..

[3]  Alan Burns,et al.  Real-Time Systems and Programming Languages , 2009 .

[4]  Tei-Wei Kuo,et al.  Load adjustment in adaptive real-time systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

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

[6]  Marco Spuri,et al.  Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling , 1996 .

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

[8]  Phillip A. Laplante,et al.  Real-Time System Design and Analysis , 2004 .

[9]  Wang Yong-Ji,et al.  Online Feasibility Analysis with Composite-Deadline , 2007, 2007 Innovations in Information Technologies (IIT).

[10]  Alan Burns,et al.  Real-Time Systems and Programming Languages - Ada, Real-Time Java and C / Real-Time POSIX, Fourth Edition , 2009, International computer science series.

[11]  Mario Marchese,et al.  Recent advances in wireless networks and systems , 2006, Comput. Electr. Eng..

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

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

[14]  Wei-Kuan Shih,et al.  Rate monotonic schedulability tests using period-dependent conditions , 2007, Real-Time Systems.

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

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

[17]  Phillip A. Laplante,et al.  Real-Time Systems Design and Analysis , 1992 .

[18]  Yongji Wang,et al.  Revisiting Fixed Priority Techniques , 2007, EUC.

[19]  Krishna M. Kavi,et al.  A non-preemptive scheduling algorithm for soft real-time systems , 2007, Comput. Electr. Eng..

[20]  Zonghua Gu,et al.  Optimal Static Task Scheduling on Reconfigurable Hardware Devices Using Model-Checking , 2007, 13th IEEE Real Time and Embedded Technology and Applications Symposium (RTAS'07).

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

[22]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[23]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

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

[25]  Pau Marti.  Analysis and Design of Real-Time Control Systems with Varying Control Timing Constraints , 2002 .

[26]  Giorgio C. Buttazzo,et al.  A hyperbolic bound for the rate monotonic algorithm , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.