Some of the CPU Scheduling algorithms are given below:
First come first serve (FCFS), Shortest remaining job first (SRJF), Priority scheduling, Round Robin (RR), Highest response ratio next (HRRN), Multilevel feedback queue scheduling (MLFQ).
Which of the algorithms does not suffer from starvation.

(A) Round – Robin and MLFQ only
(B) Round – Robin, HRRN and MLFQ only
(C) HRRN and MLFQ only
(D) Round – Robin, HRRN and FCFS only


Answer: (D)

Explanation:

• Multilevel Feedback Queue Scheduling – A process in the lower priority queue can suffer from starvation due to some short processes taking all the CPU time.
• Shortest Job First (SRJF) scheduling – Like shortest job first, it has the potential for process starvation.
• Highest Response Ratio Next (HRRN) Scheduling – Jobs gain higher priority the longer they wait, which prevents indefinite postponement (process starvation).
• Round Robin scheduling – It is simple, easy to implement, and starvation-free as all processes get fair share of CPU.

  First Come First Serve (FCFS) – Simplest scheduling algorithm that schedules according to arrival times of processes which avoid starvation.

Hence, option (D) is correct.

Quiz of this Question