A HYBRID TEST FOR FASTER FEASIBILITY ANALYSIS OF PERIODIC TASKS

In this paper, the issue of impracticality of testing the feasibility of periodic tasks at run time is studied. We provide an exact test, which is a hybrid solution obtained through both inexact (sufficient but not necessary) and exact (necessary and sufficient) schedulability tests. The task set is divided into two subsets such that (a) all tasks in therst group can be scheduled and the feasibility of this part is tested by the inexact test, while (b) the feasibility of the second group that consists of both schedulable and un- schedulable tasks is determined by the exact test. The proposed test outperforms existing alternatives from the perspective of execution time, and becomes an ideal candidate for determining feasibility of online systems. In addition, two well-known bounds, namely LL-bound and H-bound, are compared and it is proved that the H-bound is always true when the LL-bound holds.

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

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

[3]  WangLizhe,et al.  A comparative study of rate monotonic schedulability tests , 2012 .

[4]  Sanjoy K. Baruah,et al.  Open problems in real-time scheduling , 2010, J. Sched..

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

[6]  Alan Burns,et al.  Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems , 2008, IEEE Transactions on Computers.

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

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

[9]  Wanlei Zhou,et al.  Delay Control and Parallel Admission Algorithms for Real-Time Anycast Flow , 2004, The Journal of Supercomputing.

[10]  Tei-Wei Kuo,et al.  Efficient Online Schedulability Tests for Real-Time Systems , 2003, IEEE Trans. Software Eng..

[11]  Sanjoy K. Baruah,et al.  The partitioned scheduling of sporadic tasks according to static-priorities , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[12]  Juan Li,et al.  A comparative study of rate monotonic schedulability tests , 2012, The Journal of Supercomputing.

[13]  Dong-Ik Oh,et al.  Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment , 1998, Real-Time Systems.

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

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

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

[17]  Daniel F. García,et al.  Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling , 2004, IEEE Transactions on Parallel and Distributed Systems.

[18]  Yongji Wang,et al.  Optimal task execution times for periodic tasks using nonlinear constrained optimization , 2010, The Journal of Supercomputing.

[19]  Sang Hyuk Son,et al.  Allocating fixed-priority periodic tasks on multiprocessor systems , 1995, Real-Time Systems.

[20]  Yongji Wang,et al.  Utilization bound for periodic task set with composite deadline , 2010, Comput. Electr. Eng..

[21]  Ichiro Iimura,et al.  CONSIDERATION ON DISTRIBUTED IMMUNE ALGORITHM IN JOB-SHOP SCHEDULING PROBLEM , 2009 .

[22]  Jane W.-S. Liu.  Real-Time Systems , 2000, Encyclopedia of Algorithms.

[23]  Jane W.-S. Liu,et al.  Experimental Analysis of Timing Validation Methods for Distributed Real-Time Systems , 2003, The Journal of Supercomputing.