Recency and Prior Probability (RPP) based Page Replacement Policy to Cope with Weak Locality Workloads having Probabilistic Pattern

Abstract

Development of efficient block replacement policy is the topic of much research in operating system as well as database management systems. Among variety of page replacement algorithms Least Recently Used (LRU) algorithm is simple, flexible and has low overhead. LRU replaces page that is not accessed for longest time. But LRU makes bold assumption on recency factor only, which made LRU misbehave with weak locality workloads. This paper proposes a new Recency and Prior Probability (RPP) based page replacement policy for block replacement. The RPP combines recency and prior probability associated with the pages while selecting the victim frame from memory. If a page, to be used, has probability n times higher than another page, the page will get log(n) more chances to stay in the memory than lower probability pages. Hence with RPP, it is possible to prevent pages having higher probability of use from being replaced General Terms: Page Replacement, Memory Management, Operating System