14_page_replacement_algorithms_II

Numberofframesallocatedtoaprocesswillvaryover me

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: d c d c d c d b d b c b c b c • • • • • • • 3 Faults Faults 13 So…
How
much
memory
should
each
 process
get?
 First:

Do
we
really
want
to
decide
this
ahead
of
 @me?

Do
we
really
want
a
fixed
number
per
 processes?

Does
that
make
sense?
 A.  Yes
 B.  No

 14 Towards
Variable
Numbers
 
of
Page
Frames:
Locality
 The
Principle
of
Locality
 Recall:
programs
exhibit
temporal
and
spa=al
 locality
 –  90%
of
execu@on
is
sequen@al
 –  Most
itera@ve
constructs
consist
of
a
rela@vely
 small
number
of
instruc@ons
 –  When
processing
large
data
structures,
the
 dominant
cost
is
sequen@al
processing
on
 individual
structure
elements
 4
 3/7/12
 Working Set Page Replacement Explicitly
Using
Locality:
 The
Working
Set
Model
 Implementation   Keep track of the last Τ references   The...
View Full Document

This note was uploaded on 10/22/2012 for the course C S 372 taught by Professor Staff during the Spring '08 term at University of Texas at Austin.

Ask a homework question - tutors are online