Least frequently Used(LFU) algorithm

• Page with the smallest count is the one which will be selected for replacement.
• This algorithm suffers from the situation in which a page is used heavily during the initial phase of a process, but then is never used again.