Guaranteed Scheduling for (m,k)-firm Deadline-Constrained Real-Time Tasks on Multiprocessors

We present a guaranteed real-time scheduling algorithm for multiple real-time tasks subject to (m,k)-firm deadlines on homogeneous multiprocessors. The scheduling objective of the proposed algorithm is to provide guaranteed performance by bounding the probability of missing (m,k)-firm deadline constraints while improving the probability of deadline satisfactions as much as possible. This goal is established to satisfy the minimum requirements expressed by (m,k)-firm deadlines and simultaneously provide the best possible quality of service. We analytically establish that the proposed algorithm provides assurance on the bounded probability of missing (m,k)-firm constraints. Experimental studies validate our analytical results and confirm the effectiveness and superiority of the proposed scheme in achieving our scheduling objective.

[1]  Rami G. Melhem,et al.  Multiple-resource periodic scheduling problem: how much fairness is necessary? , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[2]  Zhi Wang,et al.  An integrated DBP for streams with (m, k)-firm real-time guarantee , 2004, Journal of Zhejiang University. Science.

[3]  Yongwha Chung,et al.  Guaranteed Dynamic Priority Assignment Schemes for Real-Time Tasks with (m, k)-Firm Deadlines , 2010 .

[4]  Jiming Chen,et al.  Scalability and QoS guarantee for streams with (m, k)-firm deadline , 2006, Comput. Stand. Interfaces.

[5]  Gang Quan,et al.  Enhanced fixed-priority scheduling with (m,k)-firm guarantee , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[6]  James H. Anderson,et al.  Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[7]  Hennadiy Leontyev,et al.  LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[8]  Parameswaran Ramanathan,et al.  Evaluating Dynamic Failure Probability for Streams with (m, k)-Firm Deadlines , 1997, IEEE Trans. Computers.

[9]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[10]  Guillem Bernat,et al.  Guaranteed on-line weakly-hard real-time systems , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[11]  Jiming Chen,et al.  Equivalent matrix DBP for streams with (m,k)-firm deadline , 2004, 2004 IEEE International Symposium on Industrial Electronics.

[12]  Anis Koubaa,et al.  Matrix-DBP for (m, k)-firm Real Time Guarantee , 2002 .

[13]  Parameswaran Ramanathan,et al.  Overload Management in Real-Time Control Applications Using (m, k)-Firm Guarantee , 1999, IEEE Trans. Parallel Distributed Syst..

[14]  Tong Wu,et al.  Weakly hard real-time scheduling algorithm for multimedia embedded system on multiprocessor platform , 2008, 2008 First IEEE International Conference on Ubi-Media Computing.

[15]  Albert Mo Kim Cheng,et al.  Maximizing Guaranteed QoS in (m, k)-firm Real-time Systems , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).

[16]  Binoy Ravindran,et al.  An Optimal Real-Time Scheduling Algorithm for Multiprocessors , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[17]  Alan Burns,et al.  Weakly Hard Real-Time Systems , 2001, IEEE Trans. Computers.

[18]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

[19]  Sanjoy K. Baruah,et al.  Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.

[20]  Binoy Ravindran,et al.  T-L plane-based real-time scheduling for homogeneous multiprocessors , 2010, J. Parallel Distributed Comput..

[21]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.