Question

prove that among non-pre-emptive scheduling algorithms. SPN provides the minimum average waiting time .

Answer 1

SPN or SJN provides the minimum average waiting time.

• According to its nature it aligns the shortest job length as the highest priority, hence minimum waiting time.

• Shortest Process Next or Shortest Job Next always provide the minimum waiting time but the only drawback is when we have multiple processes of same length it is not possible to predict the next process/ job in line.