Cache replacement algorithm: The difference between LRU and LFU

LFU (Least frequently used) The least recently used algorithm. It is based on the idea that " if a data is used very infrequently in the last period of time, then the likelihood of being used in the future is also very small". LRU (Least recently used).

Note the difference between the LFU and the LRU algorithm, the LRU elimination rule is based on the access time, and the LFU is based on the number of visits. To give a simple example:

Suppose the cache size is 3, the data access sequence is set (2,2), set (2), get (1), get (2), set (3,3), set (+),

The LFU algorithm should be eliminated at set (3,3), and LRU should be eliminated.

　　

Cache replacement algorithm: The difference between LRU and LFU