Page 68 - slides.dvi

•
•
•
•
⇒
–
–
–
–
–
A
Operating
∗
∗
Need
Most
Frame
‘free
(e.g.
(e.g.
Systems
e.g.
e.g.
an
certain
operating
allocation
—
page
Fairness
Objectives:
Minimize
staying
Maximize
allocation
Frame
(or
in
divide
divide
frames’
allocate
allocate
policy
system
level
fraction
m
the
all
allocation
Allocation
of
min
Allocation
of
often
succeeds
frames
code
free
replacement
in
iff
system-wide
in
frames
policy
implicitly
and
proportional
memory
use
pool
memory
to
physical
to
⇒
policy
to
schemes
data.
between
few
enforced
page-fault
steal
proportion
are
n
fairness)?
memory
many
agrees
to
determine
is
multiprogramming?
rate?
during
them!
global
size
:
how
processes)
of
processes
all
to
processes)
reserved
as
page-in:
pages
process
m/n,
distribute
(i.e.
with
per-process
the
considered
any
and
number
for
for
of
remaining
core
remainder
pages
frames.
replacement.
64
used)