© Thomas Kunz 2000
SCE 574
249
The LRU
Replacement Algorithm
äAssociates
with each page the time when it was last used
äReplace
the page that has not been used for the longest time
äRealizable,
but not cheap
äSimulating
the LRU Algorithm: Aging
äassociate
a byte with each page in memory
äperiodically,
shift all the bits to the right and inserts the reference bit into the high-order
bit
äthe
page with the lowest number is the least recently used page