-
If you are trying to resolve an environment-specific issue or have a one-off question about the edge case that does not require a feature then please consider asking a question in argocd slack [channe…
-
Would you consider adding a time aware LFU, such that completely new entries can't have the probability of being evicted right after insertion?
Eg. New entries are given a 1 minute time frame to b…
-
Currently, when an object store fills up, it starts evicting objects in a least-recently-used manner.
**Some question:**
- Should we store objects on disk when we evict them?
- What should we do …
-
Hi!
Do you have any plans to add operations having read-your-writes consistency at any point in the future?
Thanks!
-
Can you give this [policy](http://highscalability.com/blog/2016/1/25/design-of-a-modern-cache.html) a try? I'd be interested in hearing feedback, concerns, ideas, etc.
-
A while back Infinispan talked about asking for a peek method. At the time you gave some other ways [1] that didn't quite do what we needed. However looking at Caffeine recently I found that you have …
-
From its paper, xorfilters are faster and more concise alternative to bloomfilters.
https://github.com/FastFilter/xorfilter
-
The existing block cache implementation uses the Clock-PRO replacement policy. The block cache is important for performance. The raw speed of accessing the block cache is an important component of rea…
-
Currently it is stated that
> // For example, if you expect your cache to hold 1,000,000 items when full,
// NumCounters should be 10,000,000 (10x). Each counter takes up 4 bits, so
// keeping 1…
-
Hi!
I was happily surprised to see that you adapted policies from my [cache simulator](https://github.com/ben-manes/caffeine/wiki/Simulator) for your research. Hopefully its been helpful.
My eva…