Sometimes we really look for what kind of caching algorithm we should use in what situations. By default we use LFU. But many times we would like to know which one to use when. Here is a summary of the issues we face with different caching algorithms.
Least frequently Used (LFU) – LFU implicitly works based on the principle of number of times you access a particular key. At the face of it, it looks cool but as soon as you think about doing processing for each thread to count the number of times it is accessed, you’re implicitly inviting performance issues and handling concurrency issues. For high load, these issues really make a big difference.
[Read more…] about Which caching algorithm to use when?