Sign inSign in
ConceptSystems & CS

Least recently used

A page replacement policy that evicts the page that has not been accessed for the longest period of time.
as Frans Kaashoek & Robert Morris defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Page replacement3Demand paging2Buffer pool1Cache eviction policies1Page table1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A cache eviction strategy that removes the block that has not been used for the longest time by the CPU.
    • 2:51Cache-Oblivious Algorithms: Searching & Sorting
  • Andy Pavlo

    Carnegie Mellon University · Undergraduate

    LRU maintains a single timestamp of when each page was last accessed and evicts the page with the oldest timestamp.
    • 50:04Buffer Pool Managers, LRU-K Eviction & Direct I/O
  • Chris Terman

    MIT · Undergraduate

    LRU is a page replacement policy that chooses to evict the page that has not been used for the longest period of time.

Lectures that assume it

1

Connections

13

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.