3,989 views
4 votes
4 votes

A starvation free job scheduling policy guarantees that no job indefinitely waits for a service. Which of the following job scheduling policies is starvation free?

  1. Priority queing
  2. Shortest job first
  3. Youngest job first
  4. Round robin

2 Answers

7 votes
7 votes
Round Robin is starvation free .Each and every process is given equal CPU time .

While the other Scheduling policy favour a a particular type of process ( say shortest job first ) which will cause Starvation !
1 votes
1 votes

Round Robin – this gives all processes equal access to the processor. The other techniques each select some “types” of processes to others (e.g. short processes, high priority processes etc). 

Answer:

Related questions

5 votes
5 votes
7 answers
1
5 votes
5 votes
2 answers
2
makhdoom ghaya asked Apr 29, 2016
6,410 views
Consider the following set of processes, with arrival times and the required CPU-burst times given in milliseconds.$\begin{array}{|l|l|l|l|} \hline \textbf{Process} & \te...
3 votes
3 votes
1 answer
3
makhdoom ghaya asked May 2, 2016
7,743 views
A CPU scheduling algorithm determines an order for the execution of its scheduled processes. Given 'n' processes to be scheduled on one processor, how many possible diffe...