Page 1 of 1

Caching Algorithm

Posted: Wed Mar 04, 2015 5:23 pm
by soeno
In early versions of PrimoCache (when it was called FancyCache), there were two algorithms available for caching:
  • LRU (Least Recently Used): Discards the least recently used data first.
  • LFU-R (Least Frequently Used): Counts how often a cache block is needed. Cache blocks that are used least often will be discarded first.

Now that PrimoCache is out of beta, I'm curious, which algorithm does it use? And is this overrideable?

Thanks,
Soen

Re: Caching Algorithm

Posted: Sat Mar 07, 2015 9:54 pm
by Davey126
In an earlier post (can't immediately find) the devs indicated the caching algorithm had been optimized and the LRU/LFU options were being depreciated. To my knowledge it is not customizable in V1.x.

Re: Caching Algorithm

Posted: Sun Mar 08, 2015 4:49 pm
by Nina
soeno wrote:In early versions of PrimoCache (when it was called FancyCache), there were two algorithms available for caching:
  • LRU (Least Recently Used): Discards the least recently used data first.
  • LFU-R (Least Frequently Used): Counts how often a cache block is needed. Cache blocks that are used least often will be discarded first.

Now that PrimoCache is out of beta, I'm curious, which algorithm does it use? And is this overrideable?

Thanks,
Soen
Both at the same time ..