= Pseudo-LRU
{wiki=Pseudo-LRU}
Pseudo-LRU (Least Recently Used) is a caching algorithm that aims to approximate the behavior of the true Least Recently Used strategy while avoiding the overhead associated with maintaining strict recency tracking for each cache entry. In typical LRU implementations, the system keeps track of the exact order in which items are accessed, which can be complex and resource-intensive, especially in systems with large caches. Pseudo-LRU simplifies this by using a simpler structure that can still offer reasonable approximations of LRU behavior.
Back to article page