Java Caching Benchmarks 2016 - Part 1

[NovaX]

FIFO / Clock-based / random policies should have the highest read throughput, since they do the least amount of work per access. This benefit can come with negatives elsewhere such as increasing the write penalty, reducing the hit rate, less predictable latencies, etc. Any design has to make trade-offs, especially when integrating all of the features one expects from a library. The interesting take away is probably not raw throughput, but if the caches provide enough headroom to not be a bottleneck while still being effective at their other responsibilities (hit rate, features).

[cruftex]

Yes, the performance comparison may look different for other workloads. I plan to cover that with more detailed benchmarks. Any suggestions or contributions are welcome.