Page Replacement Algorithms
Just like cache block replacement!
-- selects the least recently used page for replacement
-- requires knowledge about past references, more difficult to implement (thread through page table entries from most recently referenced to least recently referenced; when a page is referenced it is placed at the head of the list; the end of the list is the page to replace)
-- good performance, recognizes principle of locality