Operating System :: Process Management - Discussion
9 / 41
An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.
AFCFS scheduling algorithm
BRound robin scheduling algorithm
CShortest job first scheduling algorithm
DNone of these
Show Explanation
In the case of Round Robin(RR), if the time quantum is large, it will result to starvation, because other processes will have to wait for a long time to execute.
Only SJF or Shortest Job First scheduling algorithm is optimal in terms of average waiting time for a given set of processes i.e., average waiting time is minimum in this scheduling algorithm. In SJF, processes which have the shortest burst time are scheduled first. It is a non-preemptive scheduling algorithm.
Asked In ::
FIrst Come First Serve(FCFS) scheduling algorithms can cause long waiting times, especially when the first job takes too much CPU time.
In the case of Round Robin(RR), if the time quantum is large, it will result to starvation, because other processes will have to wait for a long time to execute.
Only SJF or Shortest Job First scheduling algorithm is optimal in terms of average waiting time for a given set of processes i.e., average waiting time is minimum in this scheduling algorithm. In SJF, processes which have the shortest burst time are scheduled first. It is a non-preemptive scheduling algorithm.
Read Full Answer
Report Error
Please Login First Click Here