Sciweavers

431 search results - page 12 / 87
» The predictability of branches in libraries
Sort
View
PLDI
1998
ACM
13 years 11 months ago
Improving Performance by Branch Reordering
The conditional branch has long been considered an expensive operation. The relative cost of conditional branches has increased as recently designed machines are now relying on de...
Minghui Yang, Gang-Ryung Uh, David B. Whalley
APCSAC
2006
IEEE
14 years 1 months ago
Using Branch Prediction Information for Near-Optimal I-Cache Leakage
This paper describes a new on-demand wakeup prediction policy for instruction cache leakage control that achieves better leakage savings than prior policies, and avoids the perform...
Sung Woo Chung, Kevin Skadron
ISCA
1997
IEEE
98views Hardware» more  ISCA 1997»
13 years 11 months ago
Target Prediction for Indirect Jumps
As the issue rate and pipeline depth of high performance superscalar processors increase, the amount of speculative work issued also increases. Because speculative work must be th...
Po-Yung Chang, Eric Hao, Yale N. Patt
IEEEPACT
2000
IEEE
13 years 12 months ago
The Effect of Code Reordering on Branch Prediction
Branch prediction accuracy is a very important factor for superscalarprocessor performance. The ability topredict the outcome of a branch allows the processor to effectively use a...
Alex Ramírez, Josep-Lluis Larriba-Pey, Mate...
ISCA
1998
IEEE
137views Hardware» more  ISCA 1998»
13 years 11 months ago
Accurate Indirect Branch Prediction
Indirect branch prediction is likely to become increasingly important in the future because indirect branches occur more frequently in object-oriented programs. With misprediction ...
Karel Driesen, Urs Hölzle