arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.03021cs.ARcs.DC
收藏

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

Limited Associativity Makes Concurrent Software Caches a Breeze

Dolev Adas, Gil Einziger, Roy Friedman

摘要:

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

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑