Modeling of cache access behavior based on Zipf's law
Modeling of cache access behavior based on Zipf's law
复制标题
DOI：
10.1145/1509084.1509086
复制
发表时间：
2008-10
期刊：
影响因子：
--
通讯作者：
Isao Kotera;Ryusuke Egawa;Hiroyuki Takizawa;Hiroaki Kobayashi
中科院分区：
文献类型：
--
作者：
Isao Kotera;Ryusuke Egawa;Hiroyuki Takizawa;Hiroaki Kobayashi
最近，可以使用多个内核同时执行多个工作负载的CHIP多处理器（CMP）已成为实现高性能处理的关键。为了提高CMP绩效，已经提出了各种共享资源管理机制。特别是，缓存分区非常有效，可以避免在共享的缓存内存下进行资源冲突。由于大多数缓存方法需要预测缓存分区移动时每个工作负载的缓存访问特性的变化，因此对于缓存分区而言，建立准确的预测模型非常重要。在本文中，我们首先使用堆栈距离分析分析了各种应用程序的缓存访问位置。我们发现，堆叠距离分布倾向于遵守Sopall ZIPF定律。为了实现有效的缓存分区，我们提出了一个基于ZIPF定律的模型，以预测堆栈距离分布的变化。使用该模型，我们还显示了一种度量的有效性，该度量已在我们以前的工作中提出，以量化工作负载需要高速缓存能力。
Recently, chip multiprocessors (CMPs) that can simultaneously execute multiple workloads using multiple cores have become a key to achieve high-performance processing. To improve CMP performance, various shared resource management mechanisms have been proposed. In particular, cache partitioning is significantly effective to avoid resource conflicts at a shared cache memory. As most cache partitioning methods need to predict the changes in cache access characteristics of each workload when the cache partition moves, it is important for cache partitioning to establish an accurate prediction model. In this paper, we first analyze the cache access locality of various applications using stack distance profiling. We figure out that stack distance distributions incline to obey socalled Zipf's law. To achieve effective cache partitioning, then, we propose a model based on Zipf's law that predicts the changes in the stack distance distributions. Using the model, we also show the validity of a measure, which has been proposed in our previous work to quantify how much a workload demands the cache capacity.