提高命中率会损害缓存吞吐量吗?(长版本)
Can Increasing the Hit Ratio Hurt Cache Throughput? (Long Version)
AI总结:
本文挑战了高缓存命中率必然带来高吞吐量的直觉,通过排队建模、实现测量和仿真验证,证明提高命中率可能损害吞吐量,且该现象在未来系统中将更明显。
摘要:
软件缓存是几乎所有计算机系统的固有组件。因此,缓存算法,特别是驱逐策略,成为许多论文的主题。几乎所有这些先前的论文都基于命中率来评估缓存算法,即在缓存中找到的请求比例,而不是在磁盘上。命中率被视为系统吞吐量或响应时间等传统性能指标的替代。直觉上,更高的命中率应该带来更高的吞吐量(和更低的响应时间),因为更多的请求在缓存(低访问时间)中找到,而不是在磁盘(高访问时间)中。本文挑战了这一直觉。我们表明,对于许多缓存算法,提高命中率实际上会损害吞吐量(和响应时间)。我们的研究采用三管齐下的方法,包括(i)排队建模和分析,(ii)实现和测量,以及(iii)仿真以验证排队模型的准确性。我们还表明,吞吐量在更高命中率下下降的现象在未来系统中可能更加明显,这些系统的趋势是更快的磁盘和每个CPU更多的核心。
英文摘要:
Software caches are an intrinsic component of almost every computer system. Consequently, caching algorithms, particularly eviction policies, are the topic of many papers. Almost all these prior papers evaluate the caching algorithm based on its hit ratio, namely the fraction of requests that are found in the cache, as opposed to disk. The hit ratio is viewed as a proxy for traditional performance metrics like system throughput or response time. Intuitively it makes sense that higher hit ratio should lead to higher throughput (and lower response time), since more requests are found in the cache (low access time) as opposed to the disk (high access time). This paper challenges this intuition. We show that increasing the hit ratio can actually hurt the throughput (and response time) for many caching algorithms. Our investigation follows a three-pronged approach involving (i) queueing modeling and analysis, (ii) implementation and measurement, and (iii) simulation to validate the accuracy of the queueing model. We also show that the phenomenon of throughput decreasing at higher hit ratios is likely to be more pronounced in future systems, where the trend is towards faster disks and higher numbers of cores per CPU.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。