Because the tasks are periodic and in phase, we only need to calculate a schedule for the least common multiple of their periods.
EDF guarantees all deadlines are met provided the total CPU utilization is ⇐ 100%
Algorithm:
- Each task that arrives has a known deadline
- Start the task with the earliest deadline
- If a new task arrives with an earlier deadline, it skips the queue, and the other task is taken off the CPU Details:
- Optimizes mitigation of maximum lateness
- Allows for new tasks to arrive during the process unlike EDD