Least Recently Used (LRU) replacement
Tag: lru-replacement
Aliases: LRU
A cache replacement policy that evicts the way in a set whose most-recent access is furthest in the past. Approximates Belady's optimal policy when temporal locality holds; exact LRU is hardware-expensive beyond 2-way and is often replaced by NMRU, tree-PLRU, or RRIP.