Page 37 - slides.dvi

•
•
•
•
•
•
–
–
–
–
–
Operating
For
∗
e.g.
∗
Static
Then
get
Systems
SJF
round
Associate
Problem:
Problem:
—
allocate
‘highest
is
Problem:
ignore?
1
0
Priority
an
example:
CPU
allocate
robin
how
Priority
per-process
preemptive
to
priority
priority’
biased
Type
with
CPU
Scheduling
quantum
system
starvation.
and
to
(integer)
.
to
interactive
.
resolve
quantum
the
towards
internal
typically
each
scheduling
priority
ties?
Scheduling
time-slicing
processes
based
CPU
highest
means
with
on
processes
where
process
(staff)
non-preemptive
in
each
priority
intensive
usage?
smallest
priority
turn.
is
variants.
3
2
Priority
jobs.
process
the
process:
integer
Type
batch
interactive
predicted
processes.
next
processes
CPU
(students)
burst
time.
33