2017
DOI: 10.1007/s11227-017-2174-8
|View full text |Cite
|
Sign up to set email alerts
|

Reducing the second-level cache conflict misses using a set folding technique

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 33 publications
0
1
0
Order By: Relevance
“…They also perform simulations to empirically analyze their approach against the work of previous researchers. Shatnawi et al [17] proposed a new cache design called "set folding", which alleviates the need of using a higher associative cache to achieve the benefits of high hit rate, lower conflict misses and lower access times. They proposed to divide the cache in two subsets, namely, the exclusive subset which hosts data blocks that have the matching indices with the set index and the shared subset which hosts data blocks with the matching indices as well as different indices.…”
Section: Related Workmentioning
confidence: 99%
“…They also perform simulations to empirically analyze their approach against the work of previous researchers. Shatnawi et al [17] proposed a new cache design called "set folding", which alleviates the need of using a higher associative cache to achieve the benefits of high hit rate, lower conflict misses and lower access times. They proposed to divide the cache in two subsets, namely, the exclusive subset which hosts data blocks that have the matching indices with the set index and the shared subset which hosts data blocks with the matching indices as well as different indices.…”
Section: Related Workmentioning
confidence: 99%