Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,680,500 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithm
CPU cache
Cache pollution
Power Architecture
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Improving the Performance of a Proxy Cache Using Tree Augmented Naive Bayes Classifier
P. J. Benadit
,
F. Francis
,
U. Muruganantham
2015
Corpus ID: 62214650
2015
2015
Improving the Performance of a Proxy Cache Using Very Fast Decision Tree Classifier
P. J. Benadit
,
F. Francis
2015
Corpus ID: 56853510
2014
2014
Performance improvement of least-recently-used policy in web proxy cache replacement using supervised machine learning
Waleed Ali
,
Sarina Sulaiman
,
Nor Bahiah Hj. Ahmad
SOCO
2014
Corpus ID: 3188005
Web proxy caching is one of the most successful solutions for improving the performance of Web-based systems. In Web proxy…
Expand
2011
2011
RT-PLRU: A New Paging Scheme for Real--Time Execution of Program Codes on NAND Flash Memory for Portable Media Players
Jong-Chan Kim
,
Duhee Lee
,
Chang-Gun Lee
,
Kanghee Kim
IEEE Transactions on Computers
2011
Corpus ID: 206625070
NAND flash memory has been widely used as a nonvolatile storage for storing data. However, it is challenging to execute program…
Expand
2011
2011
Adaptive resource management in PaaS platform using Feedback Control LRU algorithm
Rui Hu
,
Yong Li
,
Yan Zhang
International Conference on Cloud and Service…
2011
Corpus ID: 1702983
Cloud computing gets more and more popular because of its abilities on offering flexible dynamic IT infrastructure, QoS (Quality…
Expand
Highly Cited
2010
Highly Cited
2010
Adapting cache partitioning algorithms to pseudo-LRU replacement policies
Kamil Kedzierski
,
Miquel Moretó
,
F. Cazorla
,
M. Valero
IEEE International Symposium on Parallel…
2010
Corpus ID: 12943644
Recent studies have shown that cache partitioning is an efficient technique to improve throughput, fairness and Quality of…
Expand
Highly Cited
2008
Highly Cited
2008
Relative competitive analysis of cache replacement policies
Jan Reineke
,
Daniel Grund
LCTES '08
2008
Corpus ID: 8617024
Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On…
Expand
Highly Cited
2007
Highly Cited
2007
Timing predictability of cache replacement policies
Jan Reineke
,
Daniel Grund
,
C. Berg
,
R. Wilhelm
Real-Time Systems
2007
Corpus ID: 12858787
Abstract Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case…
Expand
Highly Cited
2005
Highly Cited
2005
Power-aware storage cache management
Qingbo Zhu
,
Yuanyuan Zhou
IEEE Transactions on Computers
2005
Corpus ID: 1589333
Reducing energy consumption is an important issue for data centers. Among the various components of a data center, storage is one…
Expand
Highly Cited
1994
Highly Cited
1994
Caching strategies to improve disk system performance
Ramakrishna Karedla
,
J. S. Love
,
B. Wherry
Computer
1994
Corpus ID: 5679513
I/O subsystem manufacturers attempt to reduce latency by increasing disk rotation speeds, incorporating more intelligent disk…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE