Home » Operating Systems » Operating systems miscellaneous » Question

Operating systems miscellaneous

  1. 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
Correct Option: A

SRTF is the preemptive SJF which generates less average waiting time in which jobs are schedule according to shortest remaining time.



Your comments will be displayed only after manual approval.