IEEE International Symposium on - ISPASS Performance Analysis of Systems and Software, 2004
DOI: 10.1109/ispass.2004.1291359
|View full text |Cite
|
Sign up to set email alerts
|

Performance evaluation of exclusive cache hierarchies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
2
2
2

Relationship

0
6

Authors

Journals

citations
Cited by 29 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…The LLC, with a capacity of 64 MB, is used as a shared and a 32-way set associative cache. We also assumed and modeled the two-level caches integrated in processors to be exclusive and the relationship between the two-level caches and the LLC to be inclusive [18]. As Al-Zoubi et al [19] revealed no common wisdom about the best algorithm to use as a replacement policy for the caches of the three models, we use a pseudo least recently used (PLRU) algorithm, one of the options among the various algorithms for cache block replacement.…”
Section: Modeling and Workloadsmentioning
confidence: 99%
“…The LLC, with a capacity of 64 MB, is used as a shared and a 32-way set associative cache. We also assumed and modeled the two-level caches integrated in processors to be exclusive and the relationship between the two-level caches and the LLC to be inclusive [18]. As Al-Zoubi et al [19] revealed no common wisdom about the best algorithm to use as a replacement policy for the caches of the three models, we use a pseudo least recently used (PLRU) algorithm, one of the options among the various algorithms for cache block replacement.…”
Section: Modeling and Workloadsmentioning
confidence: 99%