Software caches optimize the performance of diverse storage systems, databases and other software systems. Existing works on software caches automatically resort to fully associative cache designs. Our work shows that limited associativity caches are a promising direction for concurrent software caches. Specifically, we demonstrate that limited associativity enables simple yet efficient realizations of multiple cache management schemes that can be trivially parallelized. We show that the obtained hit ratio is usually similar to fully associative caches of the same management policy, but the throughput is improved by up to X5 compared to production-grade caching libraries, especially in multi-threaded executions.

中文翻译：

---

有限的关联性使并发软件缓存变得轻而易举

软件缓存优化了各种存储系统、数据库和其他软件系统的性能。现有的软件缓存工作自动采用完全关联的缓存设计。我们的工作表明，有限的关联缓存是并发软件缓存的一个有前途的方向。具体来说，我们证明了有限的关联性可以简单而有效地实现可以简单并行化的多个缓存管理方案。我们表明，获得的命中率通常类似于相同管理策略的完全关联缓存，但与生产级缓存库相比，吞吐量提高了 X5，尤其是在多线程执行中。