PPT Slide
Clock Page Replacement Algorithms
- In summary,
Variant Test Modification
FIFO always fail none
Basic Clock ref == 1? ref=0
Second Chance (ref == 1 || If ref==1 then ref=0
mod == 1)? else mod=0
- Book quote: Clock algorithms are versatile and effective.
Examples of Page Replacement Algorithms
- Typical program may contain millions of memory references.
- We will use small memory references with higher than normal page fault rates (to demo the algs).