Page 63 - slides.dvi

•
•
•
–
–
–
–
–
–
–
–
–
–
–
Or
Operating
a
an
Could
give
Neither
Systems
try
update
replace
discard
page
—
possible
n-bit
maintain
whenever
each
problem:
problem:
problem:
problem:
a
Page
a
page
from
Implementing
stack
with
scheme
using
stack:
page
adds
clock
on
stack
page
a
counter)
with
h/w
requires
requires
Replacement
is
seems
LRU
of
a
table
bottom
every
counters
write
of
Algorithms
overflow.
to
pages
entry
smallest
.
support,
search
changing
.
a
practical
(a
stack
6
to
referenced,
but
time
reference
on
its
a
memory
find
to
slow
value
pointers
PTE
time-of-use
even
is
(PTE)
ensure
per
doubly-linked
standard
minimum
on
field
new
then
list)
[new]
and
updated
value
every
(and
processor
to
give
(MRU))
⇒
reference
clock
memory
CPU
page
a
need
extremely
on
value
slow
top
logical
reference
another
clock
way.
without
it!)
59
(e.g.