期刊文献+

一种混合型值关联间接跳转预测机制 被引量:1

A Hybrid Value Correlation Based Indirect Jump Prediction
下载PDF
导出
摘要 准确的间接跳转预测对现代处理器的性能和能耗有效性都具有重要意义.本文提出了一种混合型值关联间接跳转预测机制,通过混合使用多种关联信息以降低间接跳转误预测率.该机制一方面依赖于编译器根据高层次数据流信息识别间接跳转指令所对应的初始关联数据值.另一方面,该机制针对间接跳转预测的不同场景分别设计了两类关联信息:单一数据值和值历史,并实现了一种低开销的硬件结构,该硬件结构在运行时刻根据不同应用场景动态选择最佳关联信息引导间接跳转预测.实验结果表明,相对于传统的BTB预测器和最新的VBBI预测器,本文机制能够有效降低误预测率,提高程序性能并降低系统能耗. Accurate indirect jump prediction is critical for the performance and energy efficiency of modern high-performance processors.This paper proposes the Hybrid Value Correlation(HVC) based indirect jump prediction,which combines various types of correlated information to reduce indirect jump mispredictions.First of all,our mechanism relies on the compiler to identify the correlated data values based on high-level dataflow information.Second,our mechanism maintains two kinds of correlated information:the single data value and the value history.Our mechanism makes use of a low-cost hardware structure,which dynamically chooses the best correlated information for indirect jump prediction according to different processor states.Experimental results show that HVC prediction can significantly reduce the misprediction rate over the baseline-BTB prediction and the state-of-the-art VBBI prediction.The low misprediction rate of HVC prediction leads to better performance and lower power consumption over previous predictors.
出处 《电子学报》 EI CAS CSCD 北大核心 2012年第11期2298-2302,共5页 Acta Electronica Sinica
基金 国家核高基重大专项(No.2009ZX01029-001-002 No.2009ZX01036-001-003) 北京市自然科学基金(No.4123098)
关键词 转移预测 间接跳转 值关联 混合型预测器 branch prediction indirect jump value correlation hybrid prediction
  • 相关文献

参考文献18

  • 1H Kim, et al. VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization[ A]. Int' 1 Symposium on Computer Architecture [ C ]. IEIE Computer Society ,2007.424 - 435.
  • 2M U Farooq, et al. Value based BTB indexing for indirect jump prediction[ A]. Int'l symposium on I-Iigh-Perfonnae Comput- er Architecture[ C ]. New York: ACM, 2010.1 - 11.
  • 3朱德新,程旭,慎辉.UNICORE体系结构中动态转移预测机制的研究与设计[J].电子学报,2004,32(8):1351-1355. 被引量:3
  • 4M X Tan, et al. Energy-efficient branch prediction with compil- er-guided history stack[ A ]. lnt' 1 Conference on Design, Au- tomation and Test in Europe[ C] .2012.449-454.
  • 5D R Kaeli and P G Emma. Branch history table prediction of moving target branches due to subroutine returns [ A]. Int'l Symposium on Computer Architecture[ C]. II.F.E Computer So- ciety, 1991.34 - 42.
  • 6J K F Lee and A J Smith. Branch prediction strategies and branch target buffer design[J]. E. Computer, 1984,17( 1):6 --22.
  • 7Y Chang, et al. Target prediction for indirect jumps [ A ]. Int' 1 Symposium on Computer Architecture[ C]. 1997.274 - 283.
  • 8S Gochman, et al. The Intel Pentium M processor: microarchi- tecture and performance[ J]. Intel Technology Journal, 2003,7 (2) :21 - 36.
  • 9袁楠,范东睿.高性能代价比的两层关联间接转移预测器设计[J].计算机学报,2008,31(11):1898-1906. 被引量:2
  • 10K Driesen and U HOlzle. The cascaded predictor:economical and adaptive branch target prediction[ A]. Int'l symposium on Micmarchitecture[ C]. lEvEE. Computer Society, 1998. 249- 258.

二级参考文献25

  • 1Uh Gang-Ryung. Effectively exploiting indirect jumps[Ph. D. dissertation]. Florida State University, Tallahassee, Florida, 1997
  • 2Driesen K, Holzle U. Accurate indirect branch prediction// Proceedings of the International Symposium on Computer Architecture. Barcelona, Spain, 1998:167-178
  • 3Sprangle E, Chappell R S, Alsup M, Patt Y N. The agree predictor: A mechanism for reducing negative branch history interference//Proceedings of the 24th International Symposium on Computer Architecture. Denver, Colorado, USA, 1997: 284-291
  • 4Lee Chih-Chieh, Chen I-C K, Mudge T N. The bi-mode branch predictor//Proceedings of the 30th International Symposium on Microarchitecture. North Cardinal, USA, 1997: 4-13
  • 5Michaud P, Seznec A, Uhlig R. Trading conflict and capacity aliasing in conditional branch predictors//Proceedings of the 24th International Symposium on Computer Architecture. Denver, Colorado, USA, 1997:292-303
  • 6Eden A N, Mudge T. The YAGS branch prediction scheme//Proceedings of 31st International Symposium on Microarchitecture. Dallas, Texas, USA, 1998:69-77
  • 7Yeh T, Patt Y. Two-level adaptive training branch prediction//Proceedings of the International Symposium on Microarchitecture. Albuquerque, New Mexico, 1991:51-61
  • 8Chang P, Hao E, Patt Y. Target prediction for indirect jumps//Proceedings of the International Symposium on Computer Architecture. Denver, Colorado, USA, 1997:274-283
  • 9Driesen K, Holzle U. Limits of indirect prediction. University of California, Santa Barbara: Technical Report TRCS97-10, 1997
  • 10Driesen K, Holzle U. The cascaded predictor: economic and adaptive branch target prediction//Proceedings of the 31st International Symposium on Microarchitecture. Dallas, Texas, USA, 1998:249-258

共引文献3

同被引文献24

  • 1Abo A V,Lam M S,Sethi R,et al.Compilers:Principles,Techniques,Tools[M],Boston:Pearson/ AddisonWesley,2007.
  • 2Smith J E,Nair R.Virtual Machines:Versatile Platformsfor Systems and Processes[M].San Francisco:Morgan Kaufmann,2005.
  • 3Lee J K F,Smith A J.Branch prediction strategies andbranch target buffer design[J].Computer,1984,17(1):6-22.
  • 4Ertl M A,Gregg D.The behavior of efficient virtual machineinterpreters on modern architectures[G]// LNCS 2150:Proc of the 7th Int Euro-Par Conf.Berlin:Springer,2001:403-413.
  • 5Berndl M,Vitale B,Zaleski M,et al.Context threading:Aflexible and efficient dispatch technique for virtual machineinterpreters[C]// Proc of the Int Symp on Code Generationand Optimization.Los Alamitos,CA:IEEE Computer Society, 2005:15-26.
  • 6Kaeli D R,Emma P G.Branch history table prediction ofmoving target branches due to subroutine returns[C]// Procof the 18th Annual Int Symp on Computer Architecture.New York:ACM,1991:34-42.
  • 7Chang P Y,Hao E,Patt Y N.Target prediction for indirectjumps[C]//Proc of the 24th Annual Int Symp on ComputerArchitecture.New York:ACM,1997:274-283.
  • 8Kim H,Joao J A,Mutlu O,et al.VPC prediction:Reducing the cost of indirect branches via hardware-baseddynamic devirtualization[C]// Proc of the 34th Annual IntSymp on Computer Architecture.New York:ACM,2007:424-435.
  • 9Xie Zichao,Tong Dong,Huang Mingkai,et al.TAPprediction:Reusing conditional branch predictor for indirectbranches with target address pointers[C]// Proc of the 29thInt Conf on Computer Design.New York:ACM,2011:119-126.
  • 10Seznec A,Michaud P.A case for(partially)TAggedGEometric history length branch prediction[J].Journal ofInstruction Level Parallelism,2006,8:1-23.

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部