Leveraging dynamic slicing to enhance indirect branch prediction

2014 32nd IEEE International Conference on Computer Design, ICCD 2014

Volumn , Issue , 2014, Pages 292-299

  Ghandour, Walid J ^a   Ghandour, Nadine J ^b  

^a Fahad Bin Sultan University   (Saudi Arabia)

^b LEBANESE UNIVERSITY   (Lebanon)

Author keywords

branch target prediction; correlation based prediction; dynamic slicing; indirect branch

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONDITIONAL BRANCH; DYNAMIC SLICING; INDIRECT BRANCH; INDIRECT-BRANCH PREDICTIONS; MULTIPLE TARGETS; TARGET PREDICTION; VIRTUAL FUNCTIONS;

FORECASTING;

EID: 84919636016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCD.2014.6974696     Document Type: Conference Paper

References (57)

1. 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: Micorarchitecture and performance, " Intel Technology Journal, vol. 7, 2003.
2. J. K. F. Lee and A. J. Smith, "Branch prediction strategies and branch target buffer design, " IEEE Computer, vol. 17, no. 1, 1984.
3. P. Chang, E. Hao, and Y. N. Patt, "Target prediction for indirect jumps, " ISCA'97.
4. K. Driesen and U. Holzle, "Limits of indirect branch prediction, " Santa Barbara, CA, USA, Tech. Rep., 1997.
5. K. Driesen, "Accurate indirect branch prediction, " SIGARCH Comput. Archit. News, vol. 26, no. 3, 1998.
6. V. Uzelac and A. Milenkovic, "Experiment flows and microbenchmarks for reverse engineering of branch predictor structures, " ISPASS, April 2009.
7. M. Weiser, "Program slicing, " ser. ICSE '81, 1981, pp. 439-449.
8. B. Korel and J. Laski, "Dynamic program slicing, " Inf. Process. Lett., vol. 29, pp. 155-163, October 1988.
9. A. Ramirez, J. L. Larriba-Pey, and M. Valero, "Branch prediction using profile data, " in Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing, ser. Euro-Par '01, 2001, pp. 386-393.
10. A. Mahesri, A. Fadol, and C. Zilles, "Profile-Assisted dynamic branch prediction."
11. H. Kim, J. Joao, O. Mutlu, and Y. Patt, "Profile-Assisted compiler support for dynamic predication in diverge-merge processors, " in Proceedings of the International Symposium on Code Generation and Optimization, 2007, pp. 367-378.
12. F. Gabbay and A. Mendelson, "Can program profiling support value prediction?" in MICRO 30: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture, 1997, pp. 270-280.
13. B. Calder, P. Feller, and A. Eustace, "Value profiling and optimization, " Journal of Instruction Level Parallelism, vol. 1, no. 1, pp. 1-6, 1999.
14. W. J. Ghandour, H. Akkary, and W. Masri, "The potential of using dynamic information flow analysis in data value prediction, " PACT '10, pp. 431-442, September 2010.
15. T. Moseley, D. Connors, D. Grunwald, and R. Peri, "Identifying potential parallelism via loop-centric profiling, " in Proceedings of the 4th international conference on Computing frontiers, 2007, pp. 143-152.
16. J. Kalamatianos and D. R. Kaeli, "Predicting indirect branches via data compression, " MICRO-31, 1998.
17. K. Driesen and U. Holzle, "The cascaded predictor: Economical and adaptive branch target prediction, " Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture, MICRO 31, pp. 249-258, 1998.
18. J. Kalamatianos and D. R. Kaeli, "Predicting indirect branches via data compression, " Proceedings of the 31st annual ACM/IEEE international symposium on Microarchitecture, MICRO 31, pp. 272-281, 1998.
19. T. Li, R. Bhargava, and L. K. John, "Adapting branch-Target buffer to improve the target predictability of java code, " ACM Trans. Archit. Code Optim., vol. 2, no. 2, pp. 109-130, 2005.
20. 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, " ISCA-34, 2007.
21. A. Roth, A. Moshovos, and G. S. Sohi, "Improving virtual function call target prediction via dependence-based pre-computation, " ICS '99, 1999.
22. 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, " Proceedings of the 2011 IEEE 29th International Conference on Computer Design, ICCD '11, pp. 119-126, 2011.
23. A. Seznec, "Analysis of the o-geometric history length branch predictor, " in Proceedings of the 32Nd Annual International Symposium on Computer Architecture, ser. ISCA '05. IEEE Computer Society, 2005, pp. 394-405.
24. A. Seznec and P. Michaud, "A case for (partially) tagged geometric history length predictors, " Journal of Instruction-Level Parallelism (JILP), 2006.
25. A. Seznec, "A 64-kbytes ittage indirect branch predictor, " In the 3rd Championship Branch Prediction, 2011.
26. A. Seznec, "A new case for the tage branch predictor, " Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture, MICRO-44 '11, pp. 117-127, 2011.
27. L. Porter and D. M. Tullsen, "Creating artificial global history to improve branch prediction accuracy, " ICS-23, pp. 266-275, June 2009.
28. D. R. Kaeli and P. G. Emma, "Improving the accuracy of history-based branch prediction, " IEEE Transactions on Computers, vol. 46, no. 4, 1997.
29. 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, " SIGOPS Oper. Syst. Rev., vol. 42, no. 2, Mar. 2008.
30. J. Mccandless and D. Gregg, "Compiler techniques to improve dynamic branch prediction for indirect jump and call instructions, " ACM Trans. Archit. Code Optim., vol. 8, no. 4, Jan 2012.
31. M. Tan, X. Liu, T. Tong, and X. Cheng, "Cvp: An energy-efficient indirect branch prediction with compiler-guided value pattern, " Proceedings of the 26th ACM international conference on Supercomputing, ICS '12, pp. 111-120, 2012.
32. M. Farooq, L. Chen, and L. K. John, "Value based btb indexing for indirect jump prediction, " HPCA, 2010.
33. J. Ferrante, K. J. Ottenstein, and J. D. Warren, "The program dependence graph and its use in optimization, " ACM Transactions on Programming Languages and Systems (TOPLAS), vol. 9, July 1987.
34. A. Podgurski, "Significance of program dependences for software testing, debugging and maintenance, " Ph.D. dissertation, Computer Sc. Dept., U. of Mass, 1989.
35. A. Podgurski and L. Clarke, "A formal model of program dependencies and its implications for software testing, debugging, and maintenance, " IEEE TSE, vol. 16, pp. 965-979, 1990.
36. D. E. Denning and P. J. Denning, "Certification of programs for secure information flow, " Communication of the ACM, vol. 20(7), pp. 504-513, 1977.
37. B. Korel and S. Yalamanchili, "Forward computation of dynamic program slices, issta, " pp. 66-79, 1994.
38. D. E. Denning, Cryptography and Data Security. Addison-Wesley, 1982.
39. M. Bishop, "Computer security: Art and science, " vol. 2, December 2002.
40. S. Kachigan, "Statistical analysis: An interdisciplinary introduction to univariate and multivariate methods, " 1986.
41. S. Siegel, Nonparametric Statistics For The Behavioral Sciences. NY: McGraw-Hill, 1956.
42. D. J. Krus, "Visual statistics: Chapter 14, regression on multiple categories, visual-statistics.net, " 2006.
43. C. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, V. J. Reddi, and K. Hazelwood, "Pin: Building customized program analysis tools with dynamic instrumentation, " ser. PLDI '05, 2005.
44. X. Gao, M. Laurenzano, B. Simon, and A. Snavely, "Reducing overheads for acquiring dynamic memory traces, " in Workload Characterization Symposium, 2005. Proceedings of the IEEE International, 2005, pp. 46-55.
45. A. Jaleel, R. Cohn, C. Luk, and B. Jacob, "Cmpsim: A pin-based onthe-fly multi-core cache simulator, " in Proc. of the The Fourth Annual Workshop on Modeling, Benchmarking and Simulation (MoBS), 2008, pp. 28-36.
46. S. Li, J. Ahn, R. Strong, J. Brockman, D. Tullsen, and N. Jouppi, "Mcpat: An integrated power, area, and timing modeling framework for multicore and manycore architectures, " in Microarchitecture, 2009. MICRO-42. 42nd Annual IEEE/ACM International Symposium on, 2009, pp. 469-480.
47. O. Mutlu and T. Moscibroda, "Stall-Time fair memory access scheduling for chip multiprocessors, " in Proceedings of the 40th Annual IEEE/ACM International Symposium on Microarchitecture, 2007, pp. 146-160.
48. M. T. Yourst, "Ptlsim: A cycle accurate full system x86-64 microarchitectural simulator, " In Proceedings of 2007 International Symposium on Performance Analysis of Systems and Software (ISPASS2007), pp. 23-34, 2007.
49. D. B. Papworth, "Tuning the pentium pro microarchitecture, " IEEE Micro, vol. 16, pp. 8-15, April 1996.
50. The Standard Performance Evaluation Corporation (SPEC). The SPEC Benchmark Suite, " http://www.spec.org.
51. Y. Sazeides and J. E. Smith, "The predictability of data values, " Micro-30, December 1997.
52. B. Goeman, H. Vandierendonck and K. De Bosschere, "Differential fcm: Increasing value prediction accuracy by improving table usage efficiency, " HPCA'01.
53. P. Chang, E. Hao, and Y. Patt, "Target prediction for indirect jumps, " in Proceedings of the 24th annual international symposium on Computer architecture, ser. ISCA '97, 1997.
54. Y. Sazeides and J. Smith, "Implementations of context-based value predictors, " ECE-TR-97-8, University of Wisconsin-Madison, Tech. Rep., 1997.
55. Intel itanium architecture software developers manual, " January 2006, document Number: 245319-005.
56. Q. Zhao and D. J. Lilja, "Static classification of value predictability using compiler hints, " IEEE Transactions on Computers, vol. 53, pp. 929-944, Aug 2004.
57. H. Vandierendonck and K. D. Bosschere, "Implicit hints: Embedding hint bits in programs without isa changes, " ICCD, pp. 364-369, Oct. 2010.