Combining Local and Global History Hashing in Perceptron Branch Prediction
暂无分享,去创建一个
[1] Joseph T. Rahmeh,et al. Improving the accuracy of dynamic branch prediction using branch correlation , 1992, ASPLOS V.
[2] Kevin Skadron,et al. Merging path and gshare indexing in perceptron branch prediction , 2005, TACO.
[3] Yale N. Patt,et al. A comparison of dynamic branch predictors that use two levels of branch history , 1993, ISCA '93.
[4] Laurene V. Fausett,et al. Fundamentals Of Neural Networks , 1994 .
[5] Daniel A. Jiménez,et al. Fast Path-Based Neural Branch Prediction , 2003, MICRO.
[6] Yale N. Patt,et al. The agree predictor: a mechanism for reducing negative branch history interference , 1997, ISCA '97.
[7] Daniel A. Jiménez,et al. Neural methods for dynamic branch prediction , 2002, TOCS.
[8] Simon Haykin,et al. Neural Networks: A Comprehensive Foundation , 1998 .
[9] Daniel A. Jiménez. Improved latency and accuracy for neural branch prediction , 2005, TOCS.
[10] J. Nazuno. Haykin, Simon. Neural networks: A comprehensive foundation, Prentice Hall, Inc. Segunda Edición, 1999 , 2000 .
[11] Daniel A. Jiménez,et al. Dynamic branch prediction with perceptrons , 2001, Proceedings HPCA Seventh International Symposium on High-Performance Computer Architecture.
[12] Trevor N. Mudge,et al. Correlation and Aliasing in Dynamic Branch Predictors , 1996, ISCA.
[13] Trevor N. Mudge,et al. The bi-mode branch predictor , 1997, Proceedings of 30th Annual International Symposium on Microarchitecture.
[14] S. McFarling. Combining Branch Predictors , 1993 .