Labels

C program for LFU page replacement algorithm

                       The least frequently used(LFU) page-replacement algorithm requires that the page with the smallest count be replaced. The reason for this selection is that an actively used page should have a large reference count. A problem arises, however, when a page is used heavily during the initial phase of a process but then is never used again. Since it was used heavily, it has a large count and remains in memory even though it is no longer needed. One solution is to shift the counts right by1bit at regular intervals,forming an exponentially decaying average usage count.Read more>>

No comments:

Post a Comment