How Is LRU Page Replacement Algorithm Implemented?
How Is LRU Page Replacement Algorithm Implemented? In the Least Recently Used (LRU) page replacement policy, the page that is used least recently will be replaced. Implementation: Add a register to every page frame – contain the last time that the page in that frame was accessed. Use a “logical clock” that advance by 1