Editing Cache replacement policies (section)

==== {{anchor|Least-frequently used (LFU)}}Least frequently used (LFU) ====
{{Further|Least frequently used}}
The LFU algorithm counts how often an item is needed; those used less often are discarded first. This is similar to LRU, except that how many times a block was accessed is stored instead of how recently. While running an access sequence, the block which was used the fewest times will be removed from the cache.