Skip to content

asvskartheek/Cache-Optimizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

Cache-Optimizer

We intend to implement already existing algorithms for cache optimization using ML techniques.
There are two ways in which cache blocks are replaced:

  1. Eviction
  2. Prefetching

Cache Eviction

1. Driving Cache Replacement with ML-based LeCAR - Giuseppe Vietri et. al

Proposed a general framework called LeCaR that uses the ML technique of regret minimization to answer the question in the affirmative. Paper shows that the LeCaR framework outperforms ARC using only two fundamental eviction policies, LRU and LFU, by more than 18x when the cache size is small relative to the size of the working set.

Implemented in C with the following parameters:
Cache Size = 12
Size of History = 4
Learning Rate = 0.45
Discount Rate = 0.64

About

Research repository on improving cache usage

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages