Page 34 - slides.dvi

•
•
•
•
•
For
of
What
Operating
i.e.
Just
SRTF
if
SRTF
the
a
are
a
Waiting
Average
Systems
=
example:
—
the
new
time
CPU
current
waiting
for
Shortest
preemptive
0
process
Scheduling
Scheduling
problems
time:
P
1
P 1 =9;
executing
2
(9
version
P 3
P 4
here?
P 1
P 2
arrives
P
+
2
of
Process
1
4
P 2 =1;
+
P
with
3
process,
5
0
SJF.
a
Remaining-Time
P
+
2
P 3 =0;
7
Arrival
5
4
0
2
CPU
First.
2)/4
preempt.
=
Time
P 4 =2;
P
4
burst
3.
11
P
1
length
Burst
4
7
4
1
less
Time
16
than
the
remaining
30
time