earliest deadline first scheduling
/ER1 L IY0 AH0 S T D EH0 D L AY0 N F ER0 S T S K EH0 JH UH0 L IH0 NG/N
- 1
Earliest deadline first or least time to go is a dynamic priority scheduling algorithm used in real-time operating systems to place processes in a priority queue.
Translate “earliest deadline first scheduling” into another language
Choose a language below to open the translator with English selected as the source language.