Scheduling Algorithms Based on Weakly Hard Real-Time Constraint
Yansheng Lu · Journal of Chinese Computer Systems · 2006
This paper first analyzes the property of the weakly hard real-time constraint,and then presents a dynamic scheduling algorithm based on the Meet Row constraint.This scheduling algorithm is different from the traditional real-time scheduling algorithms.Traditional real-time scheduling algorithms are used to guarantee deadline while the algorithm based on weakly hard real-time constraint is used to guarantee not only deadlines but also constraints.Simulation results show that algorithm based on the weakly hard real-time constraints is better than the other scheduling algorithms based on constraints.