Least Recently Used (LRU) Algorithm
The Least Recently Used (LRU) algorithm is a cache replacement policy that evicts the least recently used items first.
4 docs tagged with "LRU"
View all tagsLeast Recently Used Page Replacement Algorithm
Least Recently Used (LRU) is a simple page replacement algorithm in which pages are replaced based on which page has been least recently used.
Least Recently used Scheduling
An overview of Least Recently Used Scheduling and its applications in programming.
LRU Cache
A complete guide to LRU (Least Recently Used) Cache -- a caching strategy using doubly linked lists and hash maps to achieve O(1) get and put operations.