Least Frequently Used (LFU) is a caching algorithm in which the least frequently used cache block is removed whenever the cache is overflowed. In LFU we check the old page as well as the frequency of that page and if the frequency of the page is larger than the old page we cannot remove it and if all the old pages are having same frequency then take last i.e FIFO method for that and remove that page.
Min-heap data structure is a good option to implement this algorithm, as it handles insertion, deletion, and update in logarithmic time complexity. A tie can be resolved by removing the least recently used cache block. The following two containers have been used to solve the problem:
- A vector of integer pairs has been used to represent the cache, where each pair consists of the block number and the number of times it has been used. The vector is ordered in the form of a min-heap, which allows us to access the least frequently used block in constant time.
- A hashmap has been used to store the indices of the cache blocks which allows searching in constant time.
Below is the implementation of the above approach:
Cache block 1 inserted. Cache block 2 inserted. Cache block 3 inserted. Cache block 4 inserted. Cache block 3 removed. Cache block 5 inserted.
- Cache Memory Design
- Design a data structure for LRU Cache
- Cache Memory in Computer Organization
- Difference between Virtual memory and Cache memory
- Implementation of Binomial Heap
- Stack Implementation in Operating System uses by Processor
- Implementation of Non-Preemptive Shortest Job First using Priority Queue
- Implementation of Binomial Heap | Set - 2 (delete() and decreseKey())
- Peterson's Algorithm for Mutual Exclusion | Set 1 (Basic C implementation)
- Find the smallest positive number missing from an unsorted array : Hashing Implementation
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Sum of nodes in the left view of the given binary tree
- XOR of elements in an array having prime frequency
- Sum of nodes in the right view of the given binary tree
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.