A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities everyT time units and decides the next process to schedule. Which one of the following is TRUE if theprocesses have no I/O operations and all arrive at time zero?

Question

Examsnet · Accepted Answer

Correct Answer is : This algorithm is equivalent to the round-robin algorithm.

GATE Computer Science (CS) 2013 Solved Paper