n Each page could be tagged (in the page table entry) with the time at each memory reference. n The LRU page is the one with the smallest time value (needs to be searched at each page fault) n This would require expensive hardware and a great deal of overhead. n Consequently very few computer systems provide sufficient hardware support for true LRU replacement policy n Other algorithms are used instead