LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance

By Song Jiang, Xiaodong Zhang. Measurement and Modeling of Computer Systems, 2002

655 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage (2008, background): “14, 10, 6, 2, 17, 13 9 [9], [5] M[1] [14], [8, 9, 10], [6] 2 [2], [17] M[12, 13]”
The evicted-address filter: A unified mechanism to address both cache pollution and thrashing (2012, background): “A number of page replacement policies have been proposed to improve virtual memory performance (e.g., [5, 18, 20, 30, 32]).”
My Cache or Yours? Making Storage More Exclusive (2002, background): “Choosing the correct cache replacement policy in an array can improve its performance [19, 21, 30, 35, 48].”
SHiP: Signature-based Hit Predictor for high performance caching (2011, methodology): “While we cannot cover all innovations in cache replacement research [1, 2, 3, 6, 10, 11, 14, 16, 18, 19, 20, 24, 26, 27, 28, 30, 31], we summarize prior art that closely resembles SHiP.”
Workload analysis of a large-scale key-value store (2012, result): “Several past studies demonstrated replacement policies with reduced eviction misses, compared to LRU, such as LIRS [19].”
Predicting whole-program locality through reuse distance analysis (2003, methodology): “[45] and by Jiang and Zhang [24] have used reuse distance in file caching.”