Scheduling Algorithms Based on Weakly Hard Real-Time Constraints

The problem of scheduling weakly hard real-time tasksis addressed in this paper. The paper first analyzes the characters ofu-pattern and weakly hard real-time constraints, then, presents twoscheduling algorithms, Meet Any Algorithm and Meet Row Algorithm, forweakly hard real-time systems. Different from traditional algorithmsused to guarantee deadlines, Meet Any Algorithm and Meet Row Algorithmcan guarantee both deadlines and constraints. Meet Any Algorithm andMeet Row Algorithm try to find out the probabilities of tasks breakingconstraints and increase task's priority in advance, but not till thelast moment. Simulation results show that these two algorithms arebetter than other scheduling algorithms dealing with constraints and canlargely decrease worst-case computation time of real-time tasks.