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
Running the shortest job first gives the minimum possible average waiting time. When all processes arrive together, shortest remaining time first behaves exactly like shortest job first. Round-robin and random order keep long jobs ahead of short ones, and giving priority to longer bursts does the opposite of what is wanted.
More CPU and I/O Scheduling questions
GATE 2017 CS (CS1) Q34– Consider the following CPU processes with arrival times (in milliseconds) and length of…
GATE 2014 CS (CS1) Q42– Single-CPU processes A,B,C,D,E have (arrival,execution) times in ms: A(0,6), B(3,2),…
GATE 2014 CS (CS2) Q42– Processes A,B,C each run 100 iterations, each consisting of t c CPU time followed by t io…
GATE 2014 CS (CS3) Q42– A preemptive OS uses shortest remaining time first. Process (arrival time, CPU burst), in…