Pseudo-LRU

Known as: PLRU, Tree-LRU 
Pseudo-LRU or PLRU is a family of cache algorithms which improve on the performance of the Least Recently Used (LRU) algorithm by replacing values… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2000-2017
02420002017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Named Data Networking (NDN) is a new content centric architecture for the future Internet aiming to improve communication… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table I
Is this relevant?
2017
2017
A huge amount of video contents have been generated and spread in the Internet. More and more users would like to view online… (More)
  • table I
  • figure 1
Is this relevant?
2015
2015
We develop an analytical modeling framework for efficient prediction of cache miss ratios based on reuse distance distributions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Review
2015
Review
2015
Cloud computing has become an exciting multidisciplinary research field, where different computing paradigms and technologies… (More)
Is this relevant?
2014
2014
In recent years, many social network systems like, YouTube, Facebook, Twitter, etc. have been a part of our everyday life. Among… (More)
  • figure 2
  • table 1
  • figure 4
  • figure 7
  • figure 9
Is this relevant?
2013
2013
This paper proposes a novel technique called mRT-PLRU (Multitasking Real-Time constrained combination of Pinning and LRU), which… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
NAND flash memory has been widely used as a nonvolatile storage for storing data. However, it is challenging to execute program… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
The cost of exploiting the remaining instruction-level parallelism (ILP) in the applications has motivated the use of thread… (More)
Is this relevant?
2008
2008
NAND flash memory has been widely used as a non-volatile storage for storing data. However, it requires a large amount of SRAM… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?