A New Fixed-Priority Scheduling Algorithm with (m,k)-Firm Guarantee

Weakly hard real-time application requires that scheduling algorithm should provide service satisfied QoS parameter, so a new fixed-priority scheduling algorithm with (m,k)-firm guarantee is presented. It assigns scheduling priority of task based on period and 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.