Scheduling Algorithms Based on Weakly Hard Real-Time Constraints

摘要

The problem of scheduling weakly hard real-time tasks is addressed in this paper.The paper first analyzes the characters ofμ-pattern and weakly hard real-time constraints, then,presents two scheduling algorithms, Meet Any Algorithm and Meet Row Algorithm, for weakly hard real-time systems. Different from traditional algorithms used to guarantee deadlines, Meet Any Algorithm and Meet Row Algorithm can guarantee both deadlines and constraints. Meet Any Algorithm and Meet Row Algorithm try to find out the probabilities of tasks breaking constraints and increase task's priority in advance, but not till the last moment. Simulation results show that these two algorithms are better than other scheduling algorithms dealing with constraints and can largely decrease worst-case computation time of real-time tasks.