FAQ, getting help, user experience about PrimoCache
soeno
Level 1
Posts: 3 Joined: Wed Mar 04, 2015 5:17 pm
Post
by soeno Wed Mar 04, 2015 5:23 pm
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
Davey126
Level 7
Posts: 99 Joined: Sun Mar 23, 2014 3:40 pm
Post
by Davey126 Sat Mar 07, 2015 9:54 pm
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.
Nina
Level 4
Posts: 38 Joined: Sat Jan 29, 2011 2:21 pm
Post
by Nina Sun Mar 08, 2015 4:49 pm
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 ..
