Karel Driesen, Urs Hölzle  Home/Search
Context Related
| ucsb.edu/TRs/techreports...TRCS9710.ps ucsb.edu/oocsb/papers/TRCS9710.pdf ucsb.edu/TRs/Docs/TRCS9710.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsb.edu/TRs/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Indirect branch prediction is likely to become more important in the future because indirect branches tend to be more frequent in object-oriented programs. With indirect branch prediction misprediction rates of around 25% on current processors, such branches can incur a significant fraction of branch misses even though indirect branches are less frequent than the more predictable conditional branches. We investigate the predictability of indirect branches to determine whether the inferior... (Update)
Context of citations to this paper: More
...second we included targets of conditional branches in the history. Both resulted in inferior prediction capacity for any pattern length p (see [DH97]) Figure 9. Misprediction rates as a function of path length (global history, per address table entries) 1 1 1 1 1 1 1 1 1 1 1...
...which caches the most recent target of the branch. As a result correct prediction rates are very low, even if we use an infinite size BTB [3]. Indirect branch frequencies are not as high as conditional branches, but their related misprediction overhead can be substantial,...
Cited by: More
Microarchitectural and Compile-Time Optimizations for.. - Kalamatianos (2000) (Correct)
Software and Hardware Techniques for Efficient Polymorphic Calls - Driesen (1999) (Correct)
Indirect Branch Prediction using Data Compression Techniques - Kalamatianos, Kaeli (1999) (Correct)
Similar documents (at the sentence level):
13.6%: Accurate Indirect Branch Prediction - Driesen, Hölzle (1998) (Correct)
Active bibliography (related documents): More All
0.5: The Cascaded Predictor: Economic and Adaptive Branch Target.. - Driesen, Hölzle (1998) (Correct)
0.5: The Cascaded Predictor: Economical and Adaptive Branch Target .. - Driesen, Hölzle (1998) (Correct)
0.4: Improving Indirect Branch Prediction With Source- and.. - Driesen, Hölzle (1998) (Correct)
Similar documents based on text: More All
0.9: Rehashable BTB: An Adaptive Branch Target Buffer to Improve .. - Li, Bhargava, John (2002) (Correct)
0.3: Message Dispatch on Pipelined Processors - Driesen, Hölzle, Vitek (1995) (Correct)
0.2: Message Dispatch on Modern Computer Architectures - Driesen, Hölzle, Vitek (1994) (Correct)
Related documents from co-citation: More All
7: Reducing Indirect Function Call Overhead in C++ Programs - Calder, Grunwald - 1994
7: QuantifyingBehavioral Differences Between C and C++ Programs - Calder, Grunwald et al. - 1994
7: Branch history table prediction of moving target branches due to subroutine retu.. (context) - Kaeli, Emma - 1991
BibTeX entry: (Update)
K. Driesen and U. Holzle. Limits of Indirect Branch Prediction. Technical Report TRCS97-10, University of California, Santa Barbara, June 1997. http://citeseer.ist.psu.edu/107993.html More
@techreport{ driesen97limits,
author = "Karel Driesen and Urs H{\"o}lzle",
title = "Limits of Indirect Branch Prediction",
number = "TRCS97-10",
month = "9,",
year = "1997",
url = "citeseer.ist.psu.edu/107993.html" }
Citations (may not include all citations):275 Shade: A Fast Instruction-Set Simulator for Execution Profil.. - Cmelik, Keppel - 1993
185 Branch prediction strategies and branch target buffer design (context) - Lee, Smith - 1984
90 Vortex: An Optimizing Compiler for Object-Oriented Languages - Dean, DeFouw et al. - 1996
85 Reducing indirect function call overhead in C++ programs - Calder, Grunwald - 1994
66 Quantifying Behavioral Differences Between C and C++ Program.. - Calder, Grunwald et al. - 1994
59 Branch history table prediction of moving target branches du.. (context) - Kaeli, Emma - 1991
57 Using Hybrid Branch Predictors to Improve Branch Prediction .. - Evers, Chang et al.
54 Dynamic Path-Based Branch Correlation (context) - Nair - 1995
43 Control flow speculation in multiscalar processors - Jacobson, Bennet et al. - 1996
42 Eliminating Virtual Function Calls in C++ Programs - Aigner, Holzle - 1996
39 Analysis of Branch Prediction via Data Compression - Chen, Coffey et al.
28 A Comparison of Dynamic Branch Predictors that use Two Level.. (context) - Yeh, Patt
25 The Direct Cost of Virtual Function Calls in C (context) - Driesen, Holzle - 1996
21 A language for describing predictors and its application to .. - Emer, Gloy - 1997
16 The role of adaptivity in two-level adaptive branch predicti.. (context) - Sechrest, Lee et al. - 1995
16 Branch Effect Reduction Techniques (context) - Uht, Sindagi et al. - 1997
14 Two-level adaptive branch prediction (context) - Yeh, Patt - 1991
12 Target Prediction for Indirect Jumps (context) - Chang, Hao et al.
12 Branch classification: A new mechanism for improving branch .. (context) - Chang, Hao et al. - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucsb.edu/TRs/): More
Compile/Run-time Support for Threaded MPI Execution on.. - Tang, Shen, Yang (1999) (Correct)
The Utility of Exploiting Idle Memory for Data-Intensive.. - Acharya, Setia (1998) (Correct)
Simple Algorithms for Multimessage Multicasting With Forwarding - Gonzalez (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC