LRU Replacement

What is LRU?

LRU means Least Recently Used, and the idea of this policy is to replace the blocks less used in the cache memory. In case where all the blocks are occupied and a new block must be accessed and it's not in memory, LRU will put this block in the position of the oldest block without a hit.

Downsides

This is designed concerning Temporal Locality but it still has downsides because accessed time should also be implemented to trace "least recently used" data.

Also, it doesn't consider the frequency of accessed rate of each data. So it'll show less efficient when the data has been accessed evenly.