Conversation so far:
is edf really a dynamic priority scheduling algorithm
Earliest deadline first (EDF) or least time to go is a dynamic priority scheduling algorithm used in real-time operating systems to place processes in a priority queue.
how does edf work
Whenever a scheduling event occurs the queue will be searched for the process closest to its deadline. This process is the next to be scheduled for execution.
what makes edf optimal
EDF is an optimal scheduling algorithm because all jobs are complete by their deadline.
what is another scheduling algorithm besides edf
Least slack time (LST) scheduling is another DPS scheduling algorithm.

Question: how does the algorithm work
Self-contained rewrite: how does lst work