![]() |
Real Time Scheduling Algorithms → Earliest Deadline First Periodic (pEDF) |
EDF can also be applied to periodic task sets. It follows from the optimality of EDF for non-periodc schedules that EDF is also optimal for periodic schedules. No additonal constraints have to be met to guarantee optimality. This implies that EDF is optimal also for the case of µ = 1.
Introduction > Real Time Scheduling Algorithms
> Earliest Deadline First Periodic (pEDF)
Back | Next |