Get started
Keyword

LRU

Description: LRU, or least recently used, is a cache and memory-management replacement policy that evicts the item that has gone unused for the longest time.
Wikidata ID: wiki/Q1810752
OpenAlex ID: keywords/lru
ARC: a self-tuning, low overhead replacement cache
2003 · Nimrod Megiddo, Dharmendra S. Modha · 777
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
1994 · Theodore Johnson, Dennis Shasha · 611
LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies
2001 · Donghee Lee, Jongmoo Choi, et al. · IEEE Transactions on Computers · 590
LIRS
2002 · Song Jiang, Xiaodong Zhang · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · 489
Caching Proxies: Limitations and Potentials
1995 · Marc Abrams, Charles R. Standridge, et al. · International World Wide Web Conference (WWW) · 443
PDF
Removal policies in network caches for World-Wide Web documents
1996 · Marc Abrams, Charles R. Standridge, et al. · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · 435
PDF
BPLRU: a buffer management scheme for improving random writes in flash storage
2008 · Hyojun Kim, S.T. Ahn · File and Storage Technologies · 420
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
2001 · Yuanyuan Zhou, James Philbin, et al. · 339
Replacement policies for a proxy cache
2000 · L. Rizzo, L. Vicisano · IEEE/ACM Transactions on Networking · 308
Caching strategies to improve disk system performance
1994 · R. Karedla, J.S. Love, et al. · Computer · 293
On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
1999 · Donghee Lee, Jongmoo Choi, et al. · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · 278
Thek-server dual and loose competitiveness for paging
1994 · N. Young · Algorithmica · 252
PDF
Online Coded Caching
2015 · Ramtin Pedarsani, Mohammad Ali Maddah-Ali, et al. · IEEE/ACM Transactions on Networking · 235
A deep reinforcement learning-based framework for content caching
2018 · Chen Zhong, M. Cenk Gursoy, et al. · Conference on Information Sciences and Systems · 220
PDF
Counter-Based Cache Replacement and Bypassing Algorithms
2008 · M. Kharbutli, Yan Solihin · IEEE Transactions on Computers · 212
CAR: Clock with Adaptive Replacement
2004 · Sorav Bansal, Dharmendra S. Modha · 194
Proxy caching that estimates page load delays
1997 · Roland P. Wooster, Marc Abrams · Computer Networks and ISDN Systems · 190
CLOCK-Pro: an effective improvement of the CLOCK replacement
2005 · Song Jiang, Feng Chen, et al. · 187
Timing predictability of cache replacement policies
2007 · Jan Reineke, Daniel Grund, et al. · Real-Time Systems · 178
Predictive caching and prefetching of query results in search engines
2003 · Ronny Lempel, Shlomo Moran · International World Wide Web Conference (WWW) · 176
Competitive Paging with Locality of Reference
1995 · A. Borodin, S. Irani, et al. · Journal of Computer and System Sciences · 165
Branch target buffer design and optimization
1993 · C.H. Perleberg, A.J. Smith · IEEE Transactions on Computers · 148
Performance evaluation of cache replacement policies for the SPEC CPU2000 benchmark suite
2004 · Hussein Al-Zoubi, Aleksandar Milenkovic, et al. · ACM Southeast Regional Conference (ACMSE) · 142
EELRU
1999 · Yannis Smaragdakis, Scott Kaplan, et al. · ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) · 140
PDF
Second-level buffer cache management
2004 · Y. Zhou, Z. Chen, et al. · IEEE Transactions on Parallel and Distributed Systems · 132
Works count: 1,344
Citation count: 17,870
Year
Topic
Type