Show simple item record

dc.contributor.authorKennedy, Ken
Qasem, Apan
dc.date.accessioned 2017-08-02T22:03:03Z
dc.date.available 2017-08-02T22:03:03Z
dc.date.issued 2005-04-10
dc.identifier.urihttps://hdl.handle.net/1911/96343
dc.description.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.
dc.format.extent 6 pp
dc.language.iso eng
dc.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).
dc.title Evaluating a Model for Cache Conflict Miss Prediction
dc.type Technical report
dc.date.note April 10, 2005
dc.identifier.digital TR05-457
dc.type.dcmi Text
dc.identifier.citation Kennedy, Ken and Qasem, Apan. "Evaluating a Model for Cache Conflict Miss Prediction." (2005) https://hdl.handle.net/1911/96343.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record