Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmCPU cacheCache pollutionPower Architecture

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Pseudo-LRU Replacement Policy in Named Data Networking Using Fat Tree DataCenter Network Architecture
Named Data Networking (NDN) is a new content centric architecture for the future Internet aiming to improve communication… 
2016
2016
A Light-Weight Content Distribution Scheme for Cooperative Caching in Telco-CDNs
A key technique to reduce the rapid growing of video-on-demand's traffic is a cooperative caching strategy aggregating multiple… 
2015
2015
Improving the Performance of a Proxy Cache Using Tree Augmented Naive Bayes Classifier
2015
2015
Improving the Performance of a Proxy Cache Using Very Fast Decision Tree Classifier
2014
2014
A dynamic execution offloading model for efficient mobile cloud computing
With the emerging of diverse applications, power-sensitive mobile devices are facing the severe challenge of computational stress… 
2013
2013
Adaptive Bit Rate capable video caching and scheduling
Adaptive Bit Rate Streaming (ABR) has become a popular video delivery technique, credited to improving the quality of delivered… 
2011
2011
RT-PLRU: A New Paging Scheme for Real--Time Execution of Program Codes on NAND Flash Memory for Portable Media Players
NAND flash memory has been widely used as a nonvolatile storage for storing data. However, it is challenging to execute program… 
2009
2009
Cache-Related Preemption Delay Computation for Set-Associative Caches - Pitfalls and Solutions
In preemptive real-time systems, scheduling analyses need - in addition to the worst-case execution time - the context-switch… 
Highly Cited
2008
Highly Cited
2008
Relative competitive analysis of cache replacement policies
Caches are commonly employed to hide the latency gap between memory and the CPU by exploiting locality in memory accesses. On… 
2005
2005
Controlling leakage power with the replacement policy in slumberous caches
As technology scales down at an exponential rate, leakage power is fast becoming the dominant component of the total power budget… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)