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, ie, the ratio of periodic tasks
which complete before their deadline. We prove that our results are never worse than those …

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, ie, the ratio of periodic tasks
which complete before their deadline. We prove that our results are never worse than those …