Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
411
An Analysis of Dynamic Branch Prediction Schemes on System Workloads
- In Proceedings of the 23rd Annual International Symposium on Computer Architecture
, 1996
"... Recent studies of dynamic branch prediction schemes rely almost exclusively on user-only simulations to evaluate performance. We find that an evaluation of these schemes with user and kernel references often leads to different conclusions. By analyzing our own Atom-generated system traces and the sy ..."
Abstract
-
Cited by 46 (0 self)
- Add to MetaCart
to predict well under user-only traces are not always the most effective on full-system traces: the recently-proposed two-level adaptive schemes can suffer from higher aliasing than the original per-branch 2-bit counter scheme. We also find that flushing the branch history state at fixed intervals does
Design and performance evaluation of global history dynamic branch predictors
- in Proc. of the 4 th International Conference on Information Systems Analysis and Synthesis - ISAS98
, 1998
"... The importance of accurate branch prediction to future processors has been widely recognized. The correct prediction of conditional branch outcomes can help avoid pipeline bubbles and attendant loss in performance. In order to achieve high prediction accuracy, numerous dynamic branch prediction sche ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
The importance of accurate branch prediction to future processors has been widely recognized. The correct prediction of conditional branch outcomes can help avoid pipeline bubbles and attendant loss in performance. In order to achieve high prediction accuracy, numerous dynamic branch prediction
Alloying Global and Local Branch History: Taxonomy, Performance, and Analysis
, 1999
"... The need for accurate conditional-branch prediction is well known: mispredictions waste large numbers of cycles and also waste power on mis-speculated computation. A number of studies have explored ways to improve the prediction accuracy of two-level predictors, but have considered exclusively glo ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
global or local history. Because most programs benefit from having both global and local history available, other work has proposed hybrid predictors that combine a global-history with a local-history component. Building on prior work that categorizes the types of branch mispredictions, this paper
Extending Correlation in Branch Prediction Schemes
- Proceedings of 25 th Euromicro International Conference
, 1999
"... The main aim of this research is to propose a new Two-Level Adaptive Branch Prediction scheme, based on additional correlation information. Conventional two-level adaptive branch prediction exploits the correlation between the outcome of a branch and the path followed through a program to reach the ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The main aim of this research is to propose a new Two-Level Adaptive Branch Prediction scheme, based on additional correlation information. Conventional two-level adaptive branch prediction exploits the correlation between the outcome of a branch and the path followed through a program to reach
An Energy-Efficient Branch Prediction with Grouped Global History
"... Abstract — Branch prediction has been playing an increas-ingly important role in improving the performance and energy efficiency for modern microprocessors. The state-of-the-art branch predictors, such as the perceptron and TAGE predic-tors, leverage novel prediction algorithms to explore longer bra ..."
Abstract
- Add to MetaCart
branch history for higher prediction accuracy. We observe that as the branch history is becoming longer, the efficiency of global history is degraded by the interference of different branch instructions. In order to mitigate the excessive influence of the branch history interference, we propose
Branch Prediction Project Write Up
"... For this project, I have researched about 10-15 papers in order to decide which predictor to use. In the literature, the most recent branch prediction schemes contain hybrid approaches and most of them use neural branch predictors or perceptrons as an ingredient [1]. But since I do not have enough k ..."
Abstract
- Add to MetaCart
For this project, I have researched about 10-15 papers in order to decide which predictor to use. In the literature, the most recent branch prediction schemes contain hybrid approaches and most of them use neural branch predictors or perceptrons as an ingredient [1]. But since I do not have enough
Branch Classification: a New Mechanism for Improving Branch Predictor Performance
- In Proceedings of the 27th International Symposium on Microarchitecture
, 1994
"... There is wide agreement that one of the most important impediments to the performance of current and future pipelined superscalar processors is the presence of conditional branches in the instruction stream. Speculative execution seems to be one solution of choice to the branch problem, but speculat ..."
Abstract
-
Cited by 91 (11 self)
- Add to MetaCart
to be associated with the branch predictor best suited to predict its direction. Using this approach, a hybrid branch predictor can be constructed such that each component branch predictor predicts those branches for which it is best suited. This paper suggests one classification scheme, analyzes several branch
Correlation and Aliasing in Dynamic Branch Predictors: Full Simulation Results
, 1996
"... Previous branch prediction studies have relied primarily upon the SPECint89 and SPECint92 benchmarks for evaluation. Most of these benchrnarb exercise a very small amount of code. As a con-sequence, the resources required by these schemes for accurate predictions of larger programs have not been cle ..."
Abstract
-
Cited by 57 (3 self)
- Add to MetaCart
the sensitivity of these prediction schemes tovariation in workload, in resources, andin design and configuration. We show that for predictors with small available resources, aliasing between distinct branches can have the domi-nant injluence on prediction accuracy. For global history based schemes, such as GAs
The impact of delay on the design of branch predictors
- In Proceedings of the 33th Annual International Symposium on Microarchitecture
, 2000
"... Modern microprocessors employ increasingly complicated branch predictors to achieve instruction fetch bandwidth that is sufficient for wide out-of-order execution cores. While existing predictors can still be accessed in a single clock cycle, recent studies show that slower wires and faster clock ra ..."
Abstract
-
Cited by 89 (10 self)
- Add to MetaCart
cannot overcome the penalties in delay that arise with larger predictor structures. We evaluate three schemes for accommodating delay: a caching approach, an overriding approach, and a cascading lookahead approach. While we use a common branch predictor, gshare, as the prediction component, these schemes
Alloyed Branch History: Combining Global and Local Branch History for Robust Performance
, 2002
"... This paper introduces alloyed prediction, a new two-level predictor organization that combines global and local history in the same structure, combining the advantages of two-level predictors and hybrid predictors. ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
This paper introduces alloyed prediction, a new two-level predictor organization that combines global and local history in the same structure, combining the advantages of two-level predictors and hybrid predictors.
Results 11 - 20
of
411
