Evaluating a Model for Cache Conflict Miss Prediction

Date
2005-04-10
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract

Cache conflict misses can cause severe degradation in application performance. Previous research has shown that for many scientific applications majority of cache misses are due to conflicts in cache. Although, conflicts in cache are a major concern for application performance it is often difficult to eliminate them completely. Eliminating conflict misses requires detailed knowledge of the cache replacement policy and the allocation of data in memory. This information is usually not available to the compiler. As such, the compiler has to resort to applying heuristics to try and minimize the occurrence of conflict misses. In this paper, we present a probabilistic method of estimating cache conflict misses for set-associative caches. We present a set of experiments evaluating the model and discuss the implications of the experimental results.

Description
Advisor
Degree
Type
Technical report
Keywords
Citation

Kennedy, Ken and Qasem, Apan. "Evaluating a Model for Cache Conflict Miss Prediction." (2005) https://hdl.handle.net/1911/96343.

Has part(s)
Forms part of
Published Version
Rights
You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
Link to license
Citable link to this page