Page 38 - slides.dvi

•
•
•
•
–
–
–
–
–
–
–
–
–
Operating
e.g.
e.g.
Use
if
in
p j
today
e.g.
first
t+1
time
once
Systems
Dynamic
p j
same
=
priority
each
—
simple
such
penalises
f
t+1
used
processes
process
slots:
CPU
for
=
computed
in
.
t
time
process
(u j ,
.
t
CPU
have
.
aging:
t
,
p j ,
a
slot
Priority
p j /2
starved
Scheduling
scheduling
runs,
t,
process
u j
t,
+
priority:
t
j
for
bound
computation
t−1 ,
Dijkstra’s
+
k
in
t
ku j
reset
p j
(static)
→
1,
.
slot
t−1 ,
THE
.
measure
.
algorithm,
t
.
.
base
+
.)
Scheduling
seconds,
the
effective
considered
but
supports
1:
CPU
I/O
priority
allow
priority.
increment
and
usage
acceptable.
a
bound.
.
of
.
priorities
to
effective
dynamic
process
j:
change
priority.
u j
effective
over
time.
priority.
34