14_page_replacement_algorithms_II

C 0 a 1 b 2 c 3 2 b 3 c 4 d 5 a 6 b 7 e 8 a 9 b 10

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: 11 a 00 a* 10 b 10 d 10 c 10 e 10 e 10 e 00 e 10 d 10 d 00 d 00 d 00 d 10 c •  Global
page
replacement
algorithms
consider
 all
the
pages
 00 c 10 e 9 The Problem With Local Page Replacement The Problem With Local Page Replacement How much memory do we allocate to a process? How much memory do we allocate to a process? 0 3 c 4 d 5 a 6 b 7 c 8 d 9 a 10 11 b c 12 d 0 Time Requests b 2 2 b a 1 1 a Page Frames Page Frames 0 Time Requests c 0 a 1 b 2 c – 3 2 b 3 c 4 d 5 a 6 b 7 c 8 d 9 a 10 11 b c 12 d 0 a a a a d d d c c c b b b 1 b b b b b a a a d d d c c 2 c c c c c c b b b a a a d • • • • • • • • • Faults Page Frames Page Frames Faults 1 a 0 a a a a a a a a a a a a a 1 b b b b b b b b b b b b b 2 c – c c c c d c d c d c d c d c d c d c d c d • 3 Faults Faults 11 12 3
 3/7/12
 Aside: Does Adding More Memory Always Reduce the Number of Faults? 0 3 c 4 d 5 a 6 b 7 e 8 a 9 b 10 11 c d 12 e 0 Time Requests b 2 2 b a 1 1 a Page Frames Page Frames 0 Time Requests Aside: Does Adding More Memory Always Reduce the Number of Faults? c 0 a 1 b 2 c – 3 2 b 3 c 4 d 5 a 6 b 7 e 8 a 9 b 10 11 c d 12 e 0 a a a a d d d e e e e b e 1 b b b b b a a a a d c c c 2 c c c c c c b b b b b d d • • • • • • Faults Page Frames Page Frames Faults 1 a 0 a a a a a a a e e e e d d 1 b b b b b b b b a a a a e 2 c – c c c c d c...
View Full Document

Ask a homework question - tutors are online