-
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. Which one of the following process scheduling algorithms would minimize the average waiting time in the ready queue?
-
- Shortest remaining time first
- Round-robin with time quantum less than the shortest CPU burst
- Uniform random
- Highest priority first with priority proportional to CPU burst length
- Shortest remaining time first
Correct Option: A
SRTF is the preemptive SJF which generates less average waiting time in which jobs are schedule according to shortest remaining time.