AdaptiveClimb: Adaptive Policy for Cache Replacement

Daniel Berend, Shlomi Dolev, Marina Kogan-Sadetsky

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations


We introduce the AdaptiveClimb cache policy, a new policy for cache management. This policy improves LRU to gain higher performance in a fixed probability scenario, without maintaining statistics for each item. Rather, it stores a single value (the current jump), while preserving the fast adaptation of probability changes of LRU. AdaptiveClimb is a modification of CLIMB cache policy, that unlike CLIMB changes the number of positions shifts according to whether the last request has been a hit or a miss. Performance of CLIMB is close to that of the optimal off-line algorithm, but its stabilization time is long. LRU is much more sensitive to changes, but it is sensitive to noise. Thus, AdaptiveClimb combines these two advantages in a single algorithm with both good performance and short stabilization time.
Original languageEnglish GB
Title of host publicationProceedings of the 12th ACM International Conference on Systems and Storage
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Number of pages1
ISBN (Electronic)9781450367493
ISBN (Print)9781450367493
StatePublished - 2019
Event12th ACM International Systems and Storage Conference, SYSTOR 2019 - Haifa, Israel
Duration: 3 Jun 20195 Jun 2019

Publication series

NameSYSTOR '19
PublisherAssociation for Computing Machinery


Conference12th ACM International Systems and Storage Conference, SYSTOR 2019

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Software


Dive into the research topics of 'AdaptiveClimb: Adaptive Policy for Cache Replacement'. Together they form a unique fingerprint.

Cite this