LIRS caching algorithm

LIRS (Low Inter-reference Recency Set) is a page replacement algorithm with an improved performance over LRU (Least Recently Used) and many other newer replacement algorithms.[1] This is achieved by using "reuse distance"[2] as the locality metric for dynamically ranking accessed pages to make a replacement decision.

Summary

Quantifying the locality

While all page replacement algorithms rely on existence of reference locality to function, a major difference among different replacement algorithms is on how this locality is qualified. LIRS uses reuse distance of a page, or the number of distinct pages accessed between two consecutive references of the page, to quantify locality. Specifically, LIRS uses last and second-to-last references (if any) for this purpose. If a page is accessed for the first time, its reuse distance is infinite. In contrast, LRU uses recency of a page, which is the number of distinctive pages accessed after the reference of the page, to quantify locality. To take into account of up-to-date access history, the implementation of LIRS actually uses the larger of reuse distance and recency of a page as the metric to quantify its locality, denoted as RD-R. Assuming the cache has a capacity of C pages, the LIRS algorithm is to rank recently accessed pages according to their RD-R values and retain the C most highly ranked pages in the cache.

The concepts of reuse distance and recency can be visualized as below, in which T1 and T2 are page B’s second-to-last and last reference times, respectively, and T3 is the current time. 

 . . . B . . . B . . . . . . . . . . B . . . . . 
               ^----Reuse Distance---^--Recency--^
               T1                    T2          T3

Selecting the replacement victim

LIRS organizes metadata of cached pages and some uncached pages and conducts its replacement operations described as below, which are also illustrated with an example [3] in the graph.

Replacement operations of LIRS
  1. The cache is divided into a Low Inter-reference Recency (LIR) and a High Inter-reference Recency (HIR) partition. The LIR partition is to store the most highly ranked pages (LIR pages) and the HIR partition is to store some of the other pages (HIR pages).
  2. The LIR partition holds the majority of the cache, and all LIR pages are resident in the cache.
  3. All recently accessed pages are placed in a FIFO queue called the LIRS stack (stack S in the graph), and all resident HIR pages are also placed in another FIFO queue (stack Q in the graph).
  4. An accessed page is moved to the top of Stack S and any HIR pages at the stack’s bottom are removed. For example, Graph (b) is produced after page B is accessed on Graph (a).
  5. When a HIR page in Stack S is accessed, it turns into a LIR page and accordingly the LIR page currently at Stack S’s bottom turns into a HIR page and moves to the top of Stack Q. For example, Graph (c) is produced after page E is accessed on Graph (a).
  6. When there is a miss and a resident page has to be replaced, the resident HIR page at the bottom of Stack Q is selected as the victim for replacement. For example, Graphs (d) and (e) are produced after pages D and C are accessed on Graph (a), respectively.

Deployment

LIRS has been deployed in MySQL since version 5.1.[4] It is also adopted in Infinispan data grid platform.[5] An approximation of LIRS, CLOCK-Pro,[6] is adopted in NetBSD.[7]

gollark: No; claims.
gollark: Don't think I actually have it.
gollark: Keansia has a constitution of some sort.
gollark: Hí.
gollark: I mean, Keansia and Chorus City don't even have tax.

See also
  • Page replacement algorithm

References
  1. Song Jiang, and Xiaodong Zhang, "LIRS: An Efficient Low Inter-Reference Recency Set Replacement Policy to Improve Buffer Cache Performance", in Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems (SIGMETRICS'02), Marina Del Rey, CA, June, 2002.
  2. J. Gecsei, D. R. Slutz, and I. L. Traiger, "Evaluation techniques for storage hierarchies", IBM Systems Journal, No. 2, 1970. https://pdfs.semanticscholar.org/4a58/e3066f12bb86d7aef2776e9d8a2a4e4daf3e.pdf
  3. Song Jiang, and Xiaodong Zhang, "Making LRU Friendly to Weak Locality Workloads: A Novel Replacement Algorithm to Improve File Buffer Cache Performance", in IEEE Transactions on Computers, 54 (8): 939-952, August 2005.
  4. svn commit - mysqldoc@docsrva: r6768 - trunk/ndbapi
  5. Infinispan eviction, batching updates and LIRS
  6. Song Jiang, Feng Chen, and Xiaodong Zhang, "CLOCK-Pro: An Effective Improvement of the CLOCK Replacement", in Proceedings of 2005 USENIX Annual Technical Conference (USENIX'05), Anaheim, CA, April, 2005.
  7. FreeBSD/Linux Kernel Cross Reference sys/uvm/uvm_pdpolicy_clockpro.c
  • Towards an O(1) VM by Rik van Riel about the possible use of LIRS for balancing cache and program memory in Linux.
  • A report on the implementation of the CLOCK-Pro page replacement.
  • Advanced Page Replacement Projects established by the Linux memory management development team.
  • CLOCK-Pro patch developed by Rik van Riel.
  • CLOCK-Pro patch developed by Peter Zijlstra.
  • CLOCK-Pro is referred as an example in the section of Linux and Academia in Book Professional Linux Kernel Architecture by Wolfgan Mauerer.
  • A paper detailing performance differences of LIRS and other algorithms “The Performance Impact of Kernel Prefetching on Buffer Cache Replacement Algorithms” by Ali R. Butt, Chris Gniady, and Y. Charlie Hu.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.