A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The…
A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler reevaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements _______ criteria.
Show answerHide answer
Correct answer: (B) Round Robin Scheduling
Explanation
The scheduling algorithm works as round robin with time quantum T. After a process has executed for T units, its waiting time becomes least (lowest priority), and its turn comes again only after every other process has had a chance for T units.