Earliest deadline first (EDF) is a dynamic priority scheduling algorithm that is used to place processes in a priority queue. Whenever a scheduling event occurs (e.g., thread finishes, grabs a mutex) the queue will search for the processes closest to its deadline, and that proces will be the next to be scheduled for execution.
To access this content, you must purchase a Membership - check out the different options here. If you're a member, log in.
Synonyms:
Earliest Deadline First
« Back to Glossary Index