RLP: Enhanced QoS Support for Real-Time Applications
Audrey Marchand, Maryline Chetto · 2006
In this paper, we study the problem of scheduling periodic task sets defined under quality of service (QoS) constraints. In our approach, periodic tasks allow occasional skips of instances. A new algorithm, called RLP (red tasks as late as possible) based on the skip-over model and the EDL (earliest deadline as late as possible) scheduling strategy, is proposed to enhance the QoS observed for periodic tasks, i.e, the ratio of periodic tasks which complete before their deadline. We prove that our results are never worse than those obtained in previous work. Experimental results also show significant improvement achieved by our algorithm over RTO and BWP.