Question

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?
1. Shortest remaining time first
2. Round – robin with time quantum less than the shortest CPU burst
3. Uniform random
4. Highest priority first with priority proportional to CPU burst length

Answer 1

Correct Answer - Option 1 : Shortest remaining time first

As all the processes are arriving at the using shortest remaining time first algorithm, we can decrease the number of processes in the queue as soon as possible thus total waiting time will decrease and so will average.