© Thomas Kunz 2000
SCE 574
241
Page Replacement
äWith
an over-allocated memory there will always be a need to replace the pages in memory.
äA
page replacement algorithm must choose a page to replace in such a way that it
minimizes the page fault rate.
äPage
Replacement Algorithms:
äFIFO
äOptimal
äNot
Recently Used (NRU)
äSecond
Chance
äLeast
Recently Used (LRU)