Page 36 - slides.dvi
P. 36
•
•
•
•
•
•
•
But
q
q
Operating
Define
Round
each
Fair:
Live:
too
too
ready
a
Round
When
if
tricky
Process
Systems
no
Typically
response
robin
milliseconds.
the
—
allocation.
at
large
small
small
process
queue.
there
get
CPU
has
⇒
Robin
⇒
time.
time
head
process
Then:
are
choosing
fixed
gets
of
n
has
some
higher
Scheduling
unit
waits
the
context
1/n th
nice
of
correct
of
FCFS/FIFO
elapsed,
more
average
ready
size
processes
Scheduling
time
switch
the
in
the
than
queue
the
properties:
called
(n
CPU.
is
a
−
quantum:
overhead
process
turnaround
ready
is
1)q
too
time
allocated
time
quantum
queue
high.
than
the
(or
and
preempted
units
CPU
the
SRTF,
and
for
before
but
time
time-slice),
(up
added
to
to)
better
receiving
the
quantum
a
one
typically
is
tail
q,
average
CPU
of
10-100
then
the
quantum.
32