| From: | Vladimir Sitnikov <sitnikov(dot)vladimir(at)gmail(dot)com> |
|---|---|
| To: | Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | W-TinyLfu for cache eviction |
| Date: | 2015-12-03 07:27:51 |
| Message-ID: | CAB=Je-EeeLWTD6WDDA8ybmifBt2+XJvkOM1vJ=m+iX-DX1t9Lg@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
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 algorithm (see [4]).
Does it make sense to evaluate the algorithm for buffer replacement?
[1]: http://arxiv.org/pdf/1512.00727v1.pdf
[2]: https://github.com/ben-manes/caffeine/wiki/Efficiency
[3]: https://github.com/ben-manes/caffeine/wiki/Benchmarks
[4]: https://github.com/ben-manes/caffeine/issues/23#issuecomment-161536706
Vladimir Sitnikov
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Craig Ringer | 2015-12-03 07:34:59 | Re: Logical replication and multimaster |
| Previous Message | konstantin knizhnik | 2015-12-03 07:27:01 | Re: Logical replication and multimaster |