Page Replacement Algorithms
Definition – these algorithms use counters for the number of references that have been made to each page
LFU – page with smallest count replaced
MFU – page with largest count replaced
Page Buffering Algorithms
Upon page fault, allows process page to be brought into a pool of free frames before the other process page is replaced; this allows processes to restart as soon as possible
Keep some pages who have been replaced into frame pools (they have also been written to disk) and if they have not been modified since, reuse them when needed without going to disk for I/O