Expand description
A simple (improved) clock page replacement algorithm.
This algorithm utilizes the ‘A’ (Accessed) and ‘D’ (Dirty) bits in the PTE (Page Table Entry) to determine which page to replace. We maintain a circular pointer to the page in the memory and evict current page if it is neither accessed nor dirty. Otherwise, we clear the first one of ‘A’ and ‘D’ bit and move to the next page.
Structs§
- Clock
Page Replacer - A page replacer based on the clock page replacement algorithm.
Traits§
- Page
- A page with ‘A’ and ‘D’ bits.