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?

• A. Round-robin with time quantum less than the shortest CPU burst
• B. Uniform random
• C. Highest priority first with priority proportional to CPU burst length
• D. Shortest remaining time first

Answer 1

The correct option is D Shortest remaining time first

To minimize the average waiting time, we need to select the shortest remaining time process first, because all are arriving at the same time and they have unequal CPU burst times.

All other options will not minimize the waiting time. So, the answer is SRTF algorithm.