Skip to search formSkip to main contentSkip to account menu

Adaptive replacement cache

Known as: ARC 
Adaptive Replacement Cache (ARC) is a page replacement algorithm with better performance than LRU (least recently used) developed at the IBM Almaden… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
FrecencyList of algorithmsList of computing and IT abbreviationsPage replacement algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Probabilistic Strategies Based on Staged LSH for Speedup of Audio Fingerprint Searching with Ten Million Scale Database
We are developing and improving algorithms to identify audio fingerprints (AFP) in a network router. Staged Locality Sensitive… 
2015
2015
Analyzing Adaptive Cache Replacement Strategies
Adaptive Replacement Cache (ARC) and CLOCK with Adaptive Replacement (CAR) are state-of-the- art "adaptive" cache replacement… 
2014
2014
Temporal join processing with the adaptive Replacement Cache - Temporal Data policy
Management of data with a time dimension increases the overhead of storage and query processing in large database applications… 
2014
2014
Performance analysis of local caching replacement policies for internet video streaming services
In this work, the performance of 5 representative caching replacement policies was investigated and compared for caching Internet… 
2011
2011
Improving Adaptive Replacement Cache ( ARC ) by Reuse Distance
Buffer caches are used to enhance the performance of file or storage systems by reducing I/O requests to underlying storage media… 
2009
2009
SSARC: The Short-Sighted Adaptive Replacement Cache
As the performance gap between disks and processors continues to increase, dozens of cache replacement policies come up to handle… 
Highly Cited
2005
Highly Cited
2005
SARC: Sequential Prefetching in Adaptive Replacement Cache
Sequentiality of reference is an ubiquitous access pattern dating back at least to Multics. Sequential workloads lend themselves… 
Highly Cited
2004
Highly Cited
2004
Outperforming LRU with an adaptive replacement cache algorithm
The self-tuning, low-overhead, scan-resistant adaptive replacement cache algorithm outperforms the least-recently-used algorithm… 
Highly Cited
2004
Highly Cited
2004
CAR: Clock with Adaptive Replacement
CLOCK is a classical cache replacement policy dating back to 1968 that was proposed as a low-complexity approximation to LRU. On… 
Highly Cited
2003
Highly Cited
2003
ARC: A Self-Tuning, Low Overhead Replacement Cache
We consider the problem of cache management in a demand paging scenario with uniform page sizes. We propose a new cache… 
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)