14_page_replacement_algorithms_II

How much memory do we allocate to a process 0 3 c 4 d

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: ed dirty used dirty replace page 0 0 1 1 0 1 0 1 0 0 0 0 1 2 3 a b c d a b c d a b c d Faults 10 a Page table entries 10 b for resident 10 c pages: 10 d 0 0 1 7 11 a 00 a* 00 a* 11 a 11 a 00 a* 11 b 00 b* 10 b* 10 b* 10 c 10 e 10 e 10 e 10 b* 10 d 10 e 00 e 10 d 00 d 00 d 00 d 10 c 00 c 8 2
 3/7/12
 The Second Chance Algorithm Example 0 Time 1 2 3 4 c aw d bw 5 e 6 b 7 aw 8 b 9 c 10 d a b c d a b c d a b e d • a b e d a b e d a b e d a b e c • a d e c Requests Page Frames Local
vs.
Global
Page
Replacement
 0 1 2 3 a b c d a b c d a b c d Faults •  Local
page
replacement
algorithms
only
 consider
the
pages
owned
by
the
faul@ng
 process
 –  Essen@ally
a
fixed
number
of
pages
per
process
 –  We
have
been
assuming
this
in
our
examples
 Page table 10 a entries for resident 10 b pages: 10 c 11 a 00 a* 00 a 11 a 11 b 00 b* 10 b 10 b...
View Full Document

Ask a homework question - tutors are online