310
Priorities
nImplemented
by having multiple ready queues to represent each level of priority
nScheduler will always choose a process of higher priority
over one of lower priority
nLower-priority may suffer starvation
nThen allow a process to change its priority based on its age
or execution history
nOur
first scheduling algorithms will not make use of priorities
nWe will then present other algorithms that use dynamic
priority mechanisms