2007
DOI: 10.1016/j.micpro.2006.08.003
|View full text |Cite
|
Sign up to set email alerts
|

Clustered indexing for branch predictors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…From the energy perspective, our technique saves more energy in the instruction cache (data and tag arrays) compared to the previous technique. When the proposed technique is combined with more accurate branch predictor such as [5] is adoped, we can have less than 0.07% performance degradation and less energy consumption.…”
Section: Resultsmentioning
confidence: 99%
“…From the energy perspective, our technique saves more energy in the instruction cache (data and tag arrays) compared to the previous technique. When the proposed technique is combined with more accurate branch predictor such as [5] is adoped, we can have less than 0.07% performance degradation and less energy consumption.…”
Section: Resultsmentioning
confidence: 99%
“…This mechanism partitions the PHT into clusters (groups) where each group contains branches with specific behavior. Using clustering mechanism makes Gshare predictor more accurate [6]. Partitioning mechanism also reduces interference in the PHT that is happen when more than one branch compete for the same entry in the PHT.…”
mentioning
confidence: 99%