TY - GEN
T1 - Modeling of cache access behavior based on Zipf's law
AU - Kotera, Isao
AU - Egawa, Ryusuke
AU - Takizawa, Hiroyuki
AU - Kobayashi, Hiroaki
PY - 2008/12/1
Y1 - 2008/12/1
N2 - 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.
AB - 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.
KW - Zipf's law
KW - cache memory
KW - cache partitioning
UR - http://www.scopus.com/inward/record.url?scp=77954453709&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77954453709&partnerID=8YFLogxK
U2 - 10.1145/1509084.1509086
DO - 10.1145/1509084.1509086
M3 - Conference contribution
AN - SCOPUS:77954453709
SN - 9781605582436
T3 - Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
SP - 9
EP - 15
BT - Proceedings of the 9th MEDEA Workshop on MEmory Performance
T2 - 9th MEDEA Workshop on MEmory Performance: DEaling with Applications, Systems and Architecture, MEDEA '08, Held in Conjunction with the PACT 2008 Conference
Y2 - 26 October 2008 through 26 October 2008
ER -