Some Systems
Real-time scheduling is the chosen field of a whole subcommunity of the computer science systems discipline. Its adherents have invented dozens of deadline scheduling algorithm variants. This section touches on a few representative algorithms.
Earliest Deadline First (EDF)
If a schedule can meet all deadlines, then the schedule that always runs the task with the earliest deadline will succeed.
Earliest Deadline First
Consider just the interval, a, between the current time and the next deadline.
The task for the next deadline, task A, must be executed in that interval or it will not meet its deadline.
Executing task A at the beginning of the interval gives it the best chance of meeting its deadline.
If there is time left over in interval ...
Get Real-Time Java™ Platform Programming now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
