<Table> <Tr> <Td> </Td> <Td> This article includes a list of references, but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations . (May 2016) (Learn how and when to remove this template message) </Td> </Tr> </Table> <Tr> <Td> </Td> <Td> This article includes a list of references, but its sources remain unclear because it has insufficient inline citations . Please help to improve this article by introducing more precise citations . (May 2016) (Learn how and when to remove this template message) </Td> </Tr> <P> Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real - time operating systems to place processes in a priority queue . Whenever a scheduling event occurs (task finishes, new task released, etc .) the queue will be searched for the process closest to its deadline . This process is the next to be scheduled for execution . </P> <P> EDF is an optimal scheduling algorithm on preemptive uniprocessors, in the following sense: if a collection of independent jobs, each characterized by an arrival time, an execution requirement and a deadline, can be scheduled (by any algorithm) in a way that ensures all the jobs complete by their deadline, the EDF will schedule this collection of jobs so they all complete by their deadline . </P>

Is edf really a dynamic priority scheduling algorithm