n Implemented by having multiple ready queues to represent each level of priority n Scheduler will always choose a process of higher priority over one of lower priority n Lower-priority may suffer starvation n Then allow a process to change its priority based on its age or execution history n Our first scheduling algorithms will not make use of priorities n We will then present other algorithms that use dynamic priority mechanisms