nPreemptive scheduling with dynamic priorities
nSeveral ready to execute queues with decreasing priorities:
uP(RQ0) > P(RQ1)
> ... > P(RQn)
nNew process are placed in RQ0
nWhen they reach the time quantum, they are placed in RQ1. If they reach it again, they are place in RQ2... until they reach RQn
nI/O-bound processes will stay in higher priority queues. CPU-bound jobs will drift downward.
nDispatcher chooses a process for execution in RQi only if RQi-1 to RQ0 are empty
nHence long jobs may starve
n