What is LRU replacement?

A cache replacement policy that evicts the least recently used data. It exploits temporal locality well, but exact tracking is costly with many ways, so approximations are used.

Field: Memory Hierarchy

Questions that mention LRU replacement (1)

  1. A fully associative cache holding 2 lines with LRU replacement starts empty. If blocks are referenced in the order A, B, A, C, B, A, how many misses occur?

Related terms

Fully associative cache Average memory access time Cache line Capacity miss Compulsory miss Conflict miss Direct-mapped cache Loop blocking Miss penalty Non-blocking cache

Back to the glossary