Sciweavers

75 search results - page 4 / 15
» Accurate Indirect Branch Prediction
Sort
View
POPL
1994
ACM
13 years 11 months ago
Reducing Indirect Function call Overhead in C++ Programs
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
Brad Calder, Dirk Grunwald
ICS
2009
Tsinghua U.
13 years 5 months ago
Creating artificial global history to improve branch prediction accuracy
Modern processors require highly accurate branch prediction for good performance. As such, a number of branch predictors have been proposed with varying size and complexity. This ...
Leo Porter, Dean M. Tullsen
MICRO
1995
IEEE
140views Hardware» more  MICRO 1995»
13 years 11 months ago
A system level perspective on branch architecture performance
Accurate instruction fetch and branch prediction is increasingly important on today’s wide-issue architectures. Fetch prediction is the process of determining the next instructi...
Brad Calder, Dirk Grunwald, Joel S. Emer
APCSAC
2007
IEEE
14 years 2 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 ...
ISCA
1997
IEEE
119views Hardware» more  ISCA 1997»
13 years 11 months ago
The Agree Predictor: A Mechanism for Reducing Negative Branch History Interference
Deeply pipelined, superscalar processors require accurate branch prediction to achieve high performance. Two-level branch predictors have been shown to achieve high prediction acc...
Eric Sprangle, Robert S. Chappell, Mitch Alsup, Ya...