Amortized efficiency of list update and paging rules
Communications of the ACM
Data cache management using frequency-based replacement
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An optimality proof of the LRU-K page replacement algorithm
Journal of the ACM (JACM)
Principles of Optimal Page Replacement
Journal of the ACM (JACM)
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Operating Systems Theory
IEEE Transactions on Computers
2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Multi-Queue Replacement Algorithm for Second Level Buffer Caches
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
WSCLOCK—a simple and effective algorithm for virtual memory management
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
ARC: A Self-Tuning, Low Overhead Replacement Cache
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
ACM SIGOPS Operating Systems Review
Three-level caching for efficient query processing in large Web search engines
WWW '05 Proceedings of the 14th international conference on World Wide Web
Advanced non-distributed operating systems course
ACM SIGCSE Bulletin
Automated data cache placement for embedded VLIW ASIPs
CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Cost-Effective Caching for Mobility Support in IEEE 802.1X Frameworks
IEEE Transactions on Mobile Computing
AMP: program context specific buffer caching
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
SARC: sequential prefetching in adaptive replacement cache
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
WOW: wise ordering for writes - combining spatial and temporal locality in non-volatile caches
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
Matrix-Stripe-Cache-Based Contiguity Transform for Fragmented Writes in RAID-5
IEEE Transactions on Computers
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Block cache for embedded systems
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
A Top-K-based cache model for deep web query
Proceedings of the 2nd international conference on Scalable information systems
Performance of compressed inverted list caching in search engines
Proceedings of the 17th international conference on World Wide Web
A refreshing perspective of search engine caching
Proceedings of the 19th international conference on World wide web
Admission policies for caches of search engine results
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
Adaptive website design using caching algorithms
WebKDD'06 Proceedings of the 8th Knowledge discovery on the web international conference on Advances in web mining and web usage analysis
Automatically constructing trusted cluster computing environment
The Journal of Supercomputing
SSD bufferpool extensions for database systems
Proceedings of the VLDB Endowment
Differentiated storage services
ACM SIGOPS Operating Systems Review
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A driver-layer caching policy for removable storage devices
ACM Transactions on Storage (TOS)
Differentiated storage services
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
Combining initial segments of lists
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
An adaptive write buffer management scheme for flash-based SSDs
ACM Transactions on Storage (TOS)
Joint management of RAM and flash memory with access pattern considerations
Proceedings of the 49th Annual Design Automation Conference
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
Processing a trillion cells per mouse click
Proceedings of the VLDB Endowment
Towards a predictive cache replacement strategy for multimedia content
Journal of Network and Computer Applications
Ant colony system with selective pheromone memory for TSP
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Optimal eviction policies for stochastic address traces
Theoretical Computer Science
An effectiveness-based adaptive cache replacement policy
Microprocessors & Microsystems
Combining initial segments of lists
Theoretical Computer Science
Estimating instantaneous cache hit ratio using Markov chain analysis
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 4.13 |
The policy of choice for managing cache memory has been to discard the least-recently-used item. LRU has consistently outperformed other policies by virtue of its simplicity and low overhead. However, an adaptive replacement cache algorithm offers a low-overhead alternative that shows substantial performance gains over LRU. ARC's online adaptation continually balances between a workload's recency and frequency features, eliminating the need for the workload-specific pretuning that plagued many previous proposals to improve LRU. The algorithm has the additional advantage of being scan-resistant so that one-time sequential requests can pass through without polluting the cache.