cache replacement policy

[npelov]

Hi,

Does primocache have an algorithm to reduce penalty of big files that are read only once or full hdd backups? In such case does primocache preserves most commonly used cache?

If not you might want to implement something like ARC. In fewer words arc is divided to two sections - one for recently read blocks and one for frequently used blocks. The size is dynamically changed depending on usage. This way recently used files are still cached, but they do not fully replace files that are frequently used every day.

[points]

Excellent idea.

[l0rdraiden]

I don't think so, right now I'm doing a synchronization (mirror backup) to amazon cloud and my l2 cache is being filled constantly at the same pace files are being synced. I'm not doing anything else in the pc.

Links of interest
https://github.com/alexanderGugel/arc
https://github.com/ben-manes/caffeine/wiki/Efficiency

TinyLFU
http://www.cs.technion.ac.il/~gilga/TinyLFU_PDP2014.pdf
https://arxiv.org/pdf/1512.00727.pdf

Interesting read
https://news.ycombinator.com/item?id=14147226