On Mon, Dec 14, 2015 at 12:18 PM, Vladimir Sitnikov <
sitnikov.vladi...@gmail.com> wrote:
> > a global lock would be good enough for a proof of concept that only
> evaluates cache hit ratios.
>
> I think emulator can be used to check hit ratios. That way we can see
> how different algorithms affect
> a global lock would be good enough for a proof of concept that only
evaluates cache hit ratios.
I think emulator can be used to check hit ratios. That way we can see
how different algorithms affect hit ratio.
Is there a set of traces of "buffer load events"? (I did some Google
searches like "po
On Wed, Dec 9, 2015 at 11:31 AM, Konstantin Knizhnik
wrote:
> I expect synchronization issues with implementation of this algorithm. It
> seems to be hard to avoid some global critical section which can cause
> significant performance degradation at MPP systems (see topic "Move
> PinBuffer and Unp
On 03.12.2015 10:27, Vladimir Sitnikov wrote:
I've recently noticed W-TinyLfu cache admission policy (see [1]) being
used for caffeine "high performance caching library for Java 8".
It demonstrates high cache hit ratios (see [2]) and enables to build
high-throughput caches (see caffeine in [3])
On Thu, Dec 3, 2015 at 2:27 AM, Vladimir Sitnikov
wrote:
> I've recently noticed W-TinyLfu cache admission policy (see [1]) being
> used for caffeine "high performance caching library for Java 8".
> It demonstrates high cache hit ratios (see [2]) and enables to build
> high-throughput caches (see
I've recently noticed W-TinyLfu cache admission policy (see [1]) being
used for caffeine "high performance caching library for Java 8".
It demonstrates high cache hit ratios (see [2]) and enables to build
high-throughput caches (see caffeine in [3])
Authors explicitly allow implementations of the a