Consider an arbitrary set of CPU-bound processes with unequal CPU burst…

PYQ GATE 2016

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. A.

    Shortest remaining time first

  2. B.

    Round-robin with time quantum less than the shortest CPU burst

  3. C.

    Uniform random

  4. D.

    Highest priority first with priority proportional to CPU burst length

Attempted by 1159 students.

Sign up free to check your answer

Sign up free

Explore the full course: Operating System

Loading lesson…