Abstract
We address lateness and tardiness scheduling policies for real-time systems. It is well-known that preemptive Earliest Deadline First (EDF) minimizes the worst lateness and tardiness of a finite set of tasks with known arrival times, service times and deadlines to the finishing time, on a uniprocessor. We extend this result significantly, to include an arbitrary (possibly infinite) number of tasks with arbitrary arrival and service times, and deadlines, and to show thatEDF 1. minimizes the lateness and tardiness of the tasks that are in the system at an arbitrary time. 2. minimizes lateness within a busy interval, for an arbitrary, possibly infinite number of tasks. 3. maximizes the time to the first missed deadline, and 4. minimizes the length of time during which there is at least one missed deadline in the system.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
