Virtual Memory Chapter 10
CS 431 -- Operating Systems
Dr. Tim McGuire
Sam Houston State University
Characteristics of Paging and Segmentation Process Execution Advantages of Partial Loading Virtual Memory: large as you wish! Possibility of trashing Locality and Virtual Memory Support Needed for
Virtual Memory Paging Page Table Structure Address Translation in a Paging System

Sharing Pages

Sharing Pages: a text editor

Translation Lookaside Buffer

Use of a Translation Lookaside Buffer (Figure 9.10)

TLB: further comments

Page Tables and Virtual Memory Multilevel Page Tables Windows NT Virtual Memory (On Intelís x86) Inverted Page Table The Page Size Issue The Page Size Issue Segmentation Address Translation in a Segmentation System (Figure 9.17)

Segmentation: comments

Sharing in Segmentation Systems Sharing of Segments: text editor example

Combined Segmentation and Paging

Address Translation in a (simple) combined Segmentation/Paging System
(Figure 9.20)
Simple Combined Segmentation and Paging Intel 386 segmentation and paging Intel 386 address translation

386 segmentation and paging: remarks

Operating System Software Fetch Policy Placement policy Replacement Policy Basic algorithms for the replacement policy The LRU Policy Note on counting page faults Implementation of the LRU Policy The FIFO Policy Comparison of FIFO with LRU The Clock Policy The Clock Policy: an example
Figure 10.13

Comparison of Clock with FIFO and LRU

Comparison of Clock with FIFO and LRU Page Buffering Page Buffering Cleaning Policy Resident Set Size Replacement Scope Fixed allocation + Local scope Fixed allocation + Global scope Variable allocation + Global scope Variable allocation + Local scope The Working Set Strategy The Working Set Strategy The Page-Fault Frequency Strategy Load Control Process Suspension