Sign inSign in
ConceptEngineering

Least recently used (LRU) replacement policy

A cache eviction policy that removes the block that has not been accessed for the longest time when a set is full.
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.

Cache memory1Cache misses1Cache organization1Cache replacement policies1Cache sets1Temporal locality1

Lecturers

1
  • Onur Mutlu

    ETH Zürich · Undergraduate

    • 50:05Caches (Digital Design and Computer Architecture, ETH Zürich, Spring 2025, Lecture 22)

Connections

3

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

1 lecturer. 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.