Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • table 1
  • table 2
  • table 3
2013
2013
Improving flash-based disk cache with Lazy Adaptive Replacement
The increasing popularity of flash memory has changed storage systems. Flash-based solid state drive(SSD) is now widely deployed… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
2012
2012
ARC-H: Adaptive replacement cache management for heterogeneous storage devices
Heterogeneous storage architectures combine the strengths of different storage devices in a synergistically useful fashion, and… Expand
  • figure 13
  • figure 10
  • figure 12
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… Expand
  • figure 1
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… Expand
  • figure 1
  • figure 2
  • figure 4
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
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… Expand
  • figure 1
  • table II
  • table I
  • figure 3
  • figure 4
2004
2004
Outperforming LRU with an Adaptive Replacement Cache Algorithm
The policy of choice for managing cache memory has been to discard the least-recently-used item. LRU has consistently… Expand
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… Expand
  • table I
  • table II
  • figure 2
  • figure 3
  • table III
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