Project ForgeConsider 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
- BRound-robin with time quantum less than the shortest CPU burst
- CUniform random
- DHighest priority first with priority proportional to CPU burst length
Explanation
Since all processes arrive at the same time (no staggered arrivals), Shortest Remaining Time First reduces to plain Shortest Job First, which is provably optimal for minimizing average waiting time among all non-preemptive-arrival scheduling policies. Round-robin with a very small quantum approximates fair time-sharing but doesn't prioritize short jobs, giving worse average waiting time; random and burst-proportional-priority orderings are both worse than shortest-job-first on average.
Source: GATE CS 2016 (Session 1 / Set A) (2016)
This question is part of a 15-day revision cycle — sign in and Project Forge will bring it back the day before you'd forget it.