Sciweavers

431 search results - page 5 / 87
» The predictability of branches in libraries
Sort
View
ISCA
1998
IEEE
155views Hardware» more  ISCA 1998»
13 years 11 months ago
A Study of Branch Prediction Strategies
In high-performance computer systems, performance losses due to conditional branch instructions can be minimized by predicting a branch outcome and fetching, decoding, and/or issu...
James E. Smith
APCSAC
2007
IEEE
14 years 1 months ago
Unbiased Branches: An Open Problem
The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but...
Arpad Gellert, Adrian Florea, Maria Vintan, Colin ...
HPCA
1998
IEEE
13 years 11 months ago
Supporting Highly-Speculative Execution via Adaptive Branch Trees
Most of the prediction mechanisms predict a single path to continue the execution on a branch. Alternatively, we may exploit parallelism from either possible paths of a branch, di...
Tien-Fu Chen
ISCA
1993
IEEE
113views Hardware» more  ISCA 1993»
13 years 11 months ago
A Comparison of Dynamic Branch Predictors that Use Two Levels of Branch History
Recent attention to speculative execution as a mechanism for increasing performance of single instruction streams has demanded substantially better branch prediction than what has...
Tse-Yu Yeh, Yale N. Patt
ISCA
2007
IEEE
115views Hardware» more  ISCA 2007»
14 years 1 months ago
VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization
Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtualmachine based runtime systems. Unfortunately, the pred...
Hyesoon Kim, José A. Joao, Onur Mutlu, Chan...