Scheduling techniques for real-time applications consisting of periodic task sets

Scheduling algorithms for applications consisting of hard deadlines are described. A preemptive scheduling algorithm that avoids unnecessary preemptions is presented. Also, a predictive nonpreemptive scheduling algorithm is given that looks at future arrival times of tasks, and schedules them nonpreemptively.<
>