is a dynamic priority preemptive scheduling algorithm built

___ is a dynamic priority preemptive scheduling algorithm built to address the critical processing requirements of real time systems and their pressing deadlines.

Variable Time Quantum per Queue

Shortest Job Next

Earliest Deadline First

( I felt that it was Round Robin, but when selected it was wrong, these are the remaining choices I have.)

Solution

Answer:

Shortest Job Next is a dynamic priority preemptive scheduling algorithm built to address the critical processing requirements of real time systems and their pressing deadlines.