Reducing indirect function call overhead in C++ programs
Brad Calder, Dirk C. Grunwald · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 1994
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and prefetching are becoming standard architectural mechanisms that rely on control flow prediction to prefetch and speculatively execute future instructions. At the same time, computer programmers are increasingly turning to object-oriented languages to increase their productivity. These languages commonly use run time dispatching to implement object polymorphism. Dispatching is usually implemented using an indirect function call, which presents challenges to existing control flow prediction techniques.
Cited by 183 works. doi:10.1145/174675.177973
Authors
References
- A study of branch prediction strategies
- Branch Prediction Strategies and Branch Target Buffer Design
- Limits of instruction-level parallelism
- Reducing the cost of branches
- The Tera computer system
- Alternative implementations of two-level adaptive branch prediction
- Improving the accuracy of dynamic branch prediction using branch correlation
- A comparison of dynamic branch predictors that use two levels of branch history
- Predicting conditional branch directions from previous runs of a program
- Optimally profiling and tracing programs