Priorities are proportional to process waiting times and start at zero. Every T time units the scheduler reevaluates priorities and selects the next process. All processes arrive at time zero and have no I/O. Which standard algorithm is equivalent?
The process not run for the longest interval has waited the most and gets the highest priority. Reconsidering after every fixed interval T cycles through ready processes, each receiving a quantum before others overtake its waiting priority. Under the intended aging convention this is round robin, B; no CPU-burst-length information is used.
More CPU and I/O Scheduling questions
GATE 2011 CS (CS1) Q45– Processes P₀,P₁,P₂ have arrivals 0,1,2 ms and bursts 9,4,9 ms respectively. Use preemptive…
GATE 2010 CS (CS1) Q35– Which are true? I: Shortest remaining time first may cause starvation. II: Preemptive…
GATE 2015 CS (CS3) Q57– Processes have (arrival,processing) times A=(0,3), B=(1,6), C=(4,4), D=(6,2). Which policy…