LIRS caching algorithm

Known as: LIRS, The 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2017
051019912017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Flash-based solid-state drives (SSDs) are getting popular to be deployed as the second-level cache in storage systems because of… (More)
Is this relevant?
2011
2011
As the DRAM based main memory significantly increases the power and cost budget of a computer system, new memory technologies… (More)
  • figure 1
  • figure 3
  • table 1
  • figure 2
  • figure 4
Is this relevant?
2011
2011
Emerging next generation memories, NVRAMs, such as Phase-change RAM (PRAM), Ferroelectric RAM (FRAM), and Magnetic RAM (MRAM) are… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Data Replication, creating identical copies of data on different sites geographically, is one of the effective optimization… (More)
  • table 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2010
2010
We have introduced a novel idea of sectorization of DCT transformed components. In this paper we have proposed two different… (More)
Is this relevant?
2005
2005
Although the LRU replacement algorithm has been widely used in buffer cache management, it is well-known for its inability to… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider the problem of cache management in a demand paging scenario with uniform page sizes. We propose a new cache… (More)
  • table I
  • table II
  • figure 2
  • figure 3
  • table III
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Although LRU replacement policy has been commonly used in the buffer cache management, it is well known for its inability to cope… (More)
Is this relevant?
1998
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1… (More)
Is this relevant?