Accurate indirect branch prediction

Authors:
Karel Driesen;Urs Hölzle
Affiliations:
Department of Computer Science, University of California, Santa Barbara, CA;Department of Computer Science, University of California, Santa Barbara, CA
Venue:
Proceedings of the 25th annual international symposium on Computer architecture
Year:
1998

Citing 20
Cited 27

Branch history table prediction of moving target branches due to subroutine returns

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
A comparison of dynamic branch predictors that use two levels of branch history

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Reducing indirect function call overhead in C++ programs

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Branch classification: a new mechanism for improving branch predictor performance

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Characterizing the impact of predicated execution on branch prediction

MICRO 27 Proceedings of the 27th annual international symposium on Microarchitecture
Object-oriented programming in the BETA programming language

Object-oriented programming in the BETA programming language
Dynamic path-based branch correlation

Proceedings of the 28th annual international symposium on Microarchitecture
Alternative implementations of hybrid branch predictors

Proceedings of the 28th annual international symposium on Microarchitecture
The role of adaptivity in two-level adaptive branch prediction

Proceedings of the 28th annual international symposium on Microarchitecture
Using hybrid branch predictors to improve branch prediction accuracy in the presence of context switches

ISCA '96 Proceedings of the 23rd annual international symposium on Computer architecture
Vortex: an optimizing compiler for object-oriented languages

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
The direct cost of virtual function calls in C++

Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Target prediction for indirect jumps

Proceedings of the 24th annual international symposium on Computer architecture
A language for describing predictors and its application to automatic synthesis

Proceedings of the 24th annual international symposium on Computer architecture
Branch Effect Reduction Techniques

Computer
One Billion Transistors, One Uniprocessor, One Chip

Computer
Eliminating Virtual Function Calls in C++ Programs

ECCOP '96 Proceedings of the 10th European Conference on Object-Oriented Programming
Control Flow Speculation in Multiscalar Processors

HPCA '97 Proceedings of the 3rd IEEE Symposium on High-Performance Computer Architecture
Accurate Indirect Branch Prediction

Accurate Indirect Branch Prediction
Shade: A Fast Instruction Set Simulator for Execution Profiling

Shade: A Fast Instruction Set Simulator for Execution Profiling

The cascaded predictor: economical and adaptive branch target prediction

MICRO 31 Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture
Improving prediction for procedure returns with return-address-stack repair mechanisms

MICRO 31 Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture
Predicting indirect branches via data compression

MICRO 31 Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture
Variable length path branch prediction

Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
Improving virtual function call target prediction via dependence-based pre-computation

ICS '99 Proceedings of the 13th international conference on Supercomputing
Branch Prediction, Instruction-Window Size, and Cache Size: Performance Trade-Offs and Simulation Techniques

IEEE Transactions on Computers
Java Runtime Systems: Characterization and Architectural Implications

IEEE Transactions on Computers
Architectural and compiler support for effective instruction prefetching: a cooperative approach

ACM Transactions on Computer Systems (TOCS)
Full-system timing-first simulation

SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Rehashable BTB: An Adaptive Branch Target Buffer to Improve the Target Predictability of Java Code

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Inlining of Virtual Methods

ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
A Comprehensive Analysis of Indirect Branch Prediction

ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
The Behavior of Efficient Virtual Machine Interpreters on Modern Architectures

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Multi-stage Cascaded Prediction

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Stress-testing Control Structures for Dynamic Dispatch in Java

Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium
Optimizing indirect branch prediction accuracy in virtual machine interpreters

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Variability in Architectural Simulations of Multi-Threaded Workloads

HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Adaptive Cache Compression for High-Performance Processors

Proceedings of the 31st annual international symposium on Computer architecture
Adapting branch-target buffer to improve the target predictability of java code

ACM Transactions on Architecture and Code Optimization (TACO)
VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization

Proceedings of the 34th annual international symposium on Computer architecture
Tuning branch predictors to support virtual method invocation in java

COOTS'99 Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5
Optimizing indirect branch prediction accuracy in virtual machine interpreters

ACM Transactions on Programming Languages and Systems (TOPLAS)
Improving the performance of object-oriented languages with dynamic predication of indirect jumps

Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
Dynamic branch prediction and control speculation

International Journal of High Performance Systems Architecture
Real-time unobtrusive program execution trace compression using branch predictor events

CASES '10 Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems
Compiler techniques to improve dynamic branch prediction for indirect jump and call instructions

ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
Compiler support for value-based indirect branch prediction

CC'12 Proceedings of the 21st international conference on Compiler Construction

Quantified Score

Hi-index	0.01

Visualization

Abstract

Indirect branch prediction is likely to become increasingly important in the future because indirect branches occur more frequently in object-oriented programs. With misprediction rates of around 25% on current processors, indirect branches can incur a significant fraction of branch misprediction overhead even though they remain less frequent than the more predictable conditional branches. We investigate a wide range of two-level predictors dedicated exclusively to indirect branches. Starting with predictors that use full-precision addresses and unlimited tables, we progressively introduce hardware constraints and minimize the loss of predictor performance at each step. For programs from the SPECint95 suite as well as a suite of large C++ applications, a two-level predictor achieves a misprediction rate of 9.8% with a 1K-entry table and 7.3% with an 8K-entry table, representing more than a threefold improvement over an ideal BTB. A hybrid predictor further reduces the misprediction rates to 8.98% (1K) and 5.95% (8K).