PPT Slide
Policies for virtual memory
- Fetch policy: demand and prepaging
- Placement policy: relevant for segmentation
- Replacement policy
- optimal
- first-in, first-out (FIFO)
- least recently used (LRU)
- clock policy and variations (1 used, 0 not)
- selects 0, every time it tests turns 1s in 0s
- second bit for page modification
- page buffering
- Locality: temporal and spatial
- Cleaning policy: demand, precleaning and buffering