CVP: An energy-efficient indirect branch prediction with compiler-guided value pattern

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2012, Pages 111-120

  Tan, Mingxing ^a   Liu, Xianhua ^a   Tong, Dong ^a   Cheng, Xu ^a  

^a PEKING UNIVERSITY   (China)

Author keywords

Compiler guided value pattern; Indirect branch prediction

Indexed keywords

COMPILER-GUIDED VALUE PATTERN; DEEP PIPELINES; ENERGY EFFICIENT; FUNCTION POINTERS; HARDWARE SUPPORTS; HIGH PERFORMANCE PROCESSORS; HIGH-LEVEL PROGRAM; INDIRECT BRANCH; LONG MEMORIES; MODERN PROCESSORS; PERFORMANCE IMPROVEMENTS; PREDICTION ACCURACY; RUNTIMES; SWITCH-CASE; VIRTUAL FUNCTIONS;

COMPUTER ARCHITECTURE; ENERGY EFFICIENCY; FORECASTING; HARDWARE;

PROGRAM COMPILERS;

EID: 84864031897     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2304576.2304593     Document Type: Conference Paper

References (35)

1. M. Al-Otoom, E. Forbes, and E. Rotenberg. EXACT: Explicit dynamic-branch prediction with active updates. In CF'10, pages 165-176, 2010.
2. T. Austin, E. Larson, and D. Ernst. SimpleScalar: an infrastructure for computer system modeling. IEEE Computer, 35(2):59-67, 2002.
3. D. Bernslein and M. Rodeh. Global instruction scheduling for superscalar machines. In PLDI'91, pages 241-255, 1991.
4. S. Borkar and A. A. Chien. The future of microprocessors. Communications of the ACM, 54(5):67-77, 2011.
5. P.-Y. Chang, E. Hao, and Y. N. Patt. Target prediction for indirect jumps. In ISCA-24, pages 274-283, 1997.
6. L. Chen, S. Dropsho, and D. H. Albonesi. Dynamic data dependence tracking and its application to branch prediction. In HPCA-9, pages 65-76, 2003.
7. K. Driesen and U. Holzle. The cascaded predictor: Economical and adaptive branch target prediction. In MICRO-31, pages 249 - 258, 1998.
8. K. Driesen and U. Holzle. Improving indirect branch prediction with source- and arity-based classification and cascaded prediction. Technical Report in University of California at Santa Barbara, 1998.
9. E. Perelman, G. Hamerly, M. Biesbbrouck, T. Sherwood, and B. Calder. Using SimPoint for accurate and efficient simulation. In SIGMETRICS'03, pages 318-319, 2003.
10. M. A. Ertl and G. David. Optimizing indirect branch prediction accuracy in virtual machine interpreters. In PLDI'03, pages 278-288, 2003.
11. M. U. Farooq, L. Chen, and L. K. John. Value Based BTB Indexing for indirect jump prediction. In HPCA-16, pages 1-11, 2010.
12. H. Gao, Y. Ma, M. Dimitrov, and H. Zhou. Address-Branch Correlation: A novel locality for long-latency hard-to-predict branches. In HPCA-14, pages 74 - 85, 2008.
13. GCC. The GNU Compiler Collection. http://gcc.gnu.org/.
14. S. Gochman, R. Ronen, I. Anati, A. Berkovits, T. Kurts, A. Naveh, A. Saeed, Z. Sperber, and R. C. Valentine. The Intel Pentium M processor: Microarchitecture and performance. Intel Technology Journal, 7(2), 2003.
15. J. Gonzalez and A. Gonzalez. Control-flow speculation through value prediction for superscalar processors. In PACT'99, pages 2-10, 1999.
16. T. H. Heil, Z. Smith, and J. E. Smith. Improving branch predictors by correlating on data values. In MICRO-32, pages 28-37, 1999. (Pubitemid 30516589)
17. R. Huang, A. Garg, and M. Huang. Software-hardware cooperative memory disambiguation. In HPCA-12, pages 244-253, 2006.
18. J. A. Joao, O. Mutlu, H. Kim, R. Agarwal, and Y. N. Patt. Improving the performance of object-oriented languages with dynamic predication of indirect jumps. In ASPLOS-XIII, pages 80-90, 2008. (Pubitemid 351585396)
19. D. R. Kaeli and P. G. Emma. Branch history table prediction of moving target branches due to subroutine returns. In ISCA-18, pages 34-42, 1991.
20. J. Kalamatianos and D. R. Kaeli. Predicting indirect branches via data compression. In MICRO-31, pages 272-281, 1998.
21. H. Kim, J. A. Joao, O. Mutlu, C. J. Lee, Y. N. Patt, and R. Cohn. VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization. In ISCA-34, pages 424-435, 2007. (Pubitemid 47582122)
22. J. K. F. Lee and A. J. Smith. Branch prediction strategies and branch target buffer design. IEEE Computer, 17(1):6-22, 1984.
23. T. Li, R. Bhargava, and L. K. John. Adapting branch-target buffer to improve the target predictability of java code. ACM Transactions on Architecture and Code Optimization, pages 109-130, 2002.
24. N. Muralimanohar, R. Balasubramonian, and N. P. Jouppi. CACTI 6.0: A tool to model large caches. HP Tech Report HPL-2009-85., 2009.
25. L. Porter and D. M. Tullsen. Creating artificial global history to improve branch prediction accuracy. In ICS-23, pages 266-275, 2009.
26. A. Roth, A. Moshovos, and G. S. Sohi. Improving virtual function call target prediction via dependence-based pre-computation. In ICS-13, pages 356-364, 1999.
27. Y. Sazeides and J. E. Smith. The predictability of data values. In MICRO-30, pages 248 - 258, 1997.
28. A. Seznec. A 64-kbytes ITTAGE indirect branch predictor. In the 3rd Championship Branch Prediction. http://www.jilp.org/jwac-2/.
29. A. Seznec. A new case for the TAGE branch predictor. In MICRO-44, 2011.
30. A. Seznec and P. Michaud. A case for (partially) TAgged GEometric history length predictors. Journal of Instruction-Level Parallelism (JILP), 2006.
31. K. Skadron, P. S. Ahuja, M. Martonosi, and D. W. Clark. Improving prediction for procedure returns with return-address-stack repair mechanisms. In MICRO-31, pages 259-271, 1998.
32. SPEC. Standard Performance Evaluation Corporation. http://www.spec.org.
33. M. Tan, X. Liu, Z. Xie, D. Tong, and X. Cheng. Energy-efficient branch prediction with compiler-guided history stack. In DATE'12, pages 449-454, 2012.
34. R. Thomas, M. Franklin, C. Wilkerson, and J. Stark. Improving branch prediction by dynamic dataflow-based identification of correlated branches from a large global history. In ISCA-30, pages 314-323, 2003.
35. Z. Xie, D. Tong, M. Huang, X. Wang, Q. Shi, and X. Cheng. TAP prediction: Reusing conditional branch predictor for indirect branches with target address pointers. In ICCD-29, pages 119-126, 2011.