Fixed-priority schedule with QoS guarantee
Jie Dong · Computer Engineering and Applications Journal · 2009
Weakly hard real-time application requires that scheduling algorithm should provide service satisfied its QoS parameter,so a new fixed-priority scheduling algorithm with (m,k)-firm guarantee is presented.It assigns scheduling priority of task based on its period and its QoS parameter,and the task is switched between preemptive state and optional state to reflect its pressure.Schedulability test inequation of the algorithm is presented in the paper.The validity and the flexibility of the algorithm are proved through the analysis of classical task sets.