Speed scheduling of fixed-priority delay-sensitive jobs

This paper addresses the problem of scheduling periodic delay-sensitive jobs with fixed priority for execution on a uniprocessor system. In contrast to previous work, our approach is based on the concept of residual work. From this aspect, the aim is to derive the schedulability condition under a given maximum execution speed. A simple on-line algorithm then follows for scheduling either preemptible or non-preemptible jobs. Simulation results show that the algorithm yields a lower job rejection probability and average energy per job, as compared to an existing algorithm.