Least frequently used

Known as: LFU, Least-frequently used 
Least Frequently Used (LFU) is a type of cache algorithm used to manage memory within a computer. The standard characteristics of this method involve… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
As shared last level caches are widely used in many-core CMPs to boost system performance, partitioning a large shared cache… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
2012
2012
In this paper, we present a new block replacement policy in which we proposed a new efficient algorithm for combining two… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Practical cache replacement policies attempt to emulate optimal replacement by predicting the re-reference interval of a cache… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2009
2009
DG application has received increasing attention during recent years. The impact of DG on various aspects of distribution system… (More)
  • figure 3
  • table 1
  • figure 2
  • table 2
  • table 6
Is this relevant?
2008
2008
There are two fundamentally different forms of uncertainty in power system reliability assessment. Aleatory uncertainty arises… (More)
  • figure 2
  • table II
  • table III
  • table I
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Based on data collected from a middle school, this study investigates how the quantity and quality of technology use aVect… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2005
2005
BACKGROUND Regional weaning centres provide cost effective care for patients who have undergone prolonged mechanical ventilation… (More)
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
ÐEfficient and effective buffering of disk blocks in main memory is critical for better file system performance due to a wide… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Sam H. Nohs Sang Lyul Mint t Department of Computer Engineering Seoul National University Seoul 151-742, Korea http://ssrnet.snu… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1996
1996
A spectrum of block replacement policies called LRFU (Least Recently/Frequently Used) is proposed for buuer caches. The proposed… (More)
Is this relevant?