Theoretical algorithm for paging in a paged virtual memory system. When no physical pages are left and a new page is needed, the page last accessed is swapped out to make room for the new page.

Never implemented in practice, due to the high overheads it would impose (memory and/or time); instead, many common algorithms utilise rules which give approximations to what LRU would (in the common case).

Log in or registerto write something here or to contact authors.