Jisho

×
Earliest Deadline First
Links
Wikipedia definition
1. Earliest deadline first scheduling​Earliest deadline first (EDF) or least time to go is a dynamic scheduling algorithm used in real-time operating systems. It places 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.
Read “Earliest deadline first scheduling” on English Wikipedia
Read “Earliest Deadline First” on Japanese Wikipedia
Read “Earliest deadline first scheduling” on DBpedia

Discussions

to talk about this word.