This Algorithm is a combination of General LRU(Last Recently Used) Algorithm and MFU (Most Frequently Used) Algorithm for Page Replacement. It gives a better performance then compared to general LRU as it's Cache Miss is lower.
Idea is to first count the cost of the page using general LRU and then multipling it with the cost of that same page using MFU Algorithm, Then all the cost is saved into an array, later when all the fragments are full, then the algorithm has to find the page with minimum value. Later that page is selected to be replaced with the new page.
We can store that array into a database so that whenever the system is started the system will automatically predict and will load those pages with maximum cost into the frame. Thus in this way the system which is used for general perpose will loose initial cache miss and it will function much faster.
Thank You!!
Tanmay Kumar