Guaranteed dynamic priority assignment scheme for streams with ( m , k )-firm deadlines

A guaranteed dynamic priority assignment scheme for multiple real-time streams with (m, k)-firm deadlines is presented. Analytical and experimental studies show that the proposed scheme provides assurance of timeliness performance and relatively high quality of service compared to existing schemes.

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

[2]  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.

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

[4]  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).

[5]  Yeqiong Song,et al.  Optimal on-line (m,k)-firm constraint assignment for real-time control tasks based on plant state information , 2008, 2008 IEEE International Conference on Emerging Technologies and Factory Automation.