[1] This is achieved by using "reuse distance"[2] as the locality metric for dynamically ranking accessed pages to make a replacement decision.
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 quantified.
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.
An in-memory LIRS cache is developed in the Red Hat JBoss Data Virtualization System.
LIRS is used in the H2 Database Engine, which is called a Scan Resistant Cache.