This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Using Indexing Functions to Reduce Conflict Aliasing in Branch Prediction Tables
August 2006 (vol. 55 no. 8)
pp. 1057-1061
High-accuracy branch prediction is crucial for high-performance processors. Inspired by the work on indexing functions to eliminate conflict-misses in memory hierarchy, this paper explores different indexing approaches to reduce conflict aliasing in branch-prediction tables. Our results show that indexing functions provide a highly complexity-effective way to enhance prediction accuracy.

[1] F. Bodin and A. Seznec, “Skewed-Associativity Improves Performance and Enhances Predictability,” IEEE Trans. Computers, vol. 46, 1997.
[2] I.K. Chen, J.T. Coffey, and T.N. Mudge, “Analysis of Branch Prediction via Data Compression,” Proc. Seventh Intl Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), 1996.
[3] J. Frailong, W. Jalby, and J. Lenfant, “XOR Schemes: A Flexible Data Organization in Parallel Memories,” Proc. Int'l Conf. Parallel Processing, 1985.
[4] A. Gonzalez, M. Valero, N. Topham, and J. Parcerisa, “Eliminating Cache Conflict Misses through XOR-Based Placement Functions,” Proc. Int'l Conf. Supercomputing (ICS-97), 1997.
[5] D. Jimenez and C. Lin, “Dynamic Branch Prediction with Perceptrons,” Proc. Seventh Int'l Symp. High Performance Computer Architecture (HPCA-7), 2001.
[6] D. Jimenez and C. Lin, “Neural Methods for Dynamic Branch Prediction,” ACM Trans. Computer Systems, 2002.
[7] M. Kharbutli, K. Irwin, Y. Solihin, and J. Lee, “Using Prime Numbers For Cache Indexing to Eliminate Conflict Misses,” Proc. 10th Int'l Symp. High Performance Computer Archictecture (HPCA-10), 2004.
[8] S. MacFarling, “Combining Branch Predictors,” technical report, DEC, 1993.
[9] P. Michaud, A. Seznec, and R. Uhlig, “Trading Conflict and Capacity Aliasing in Conditional Branch Predictors,” Proc. 24th Int'l Symp. Computer Architecture (ISCA-24), 1997.
[10] B. Rau, “Pseudo-Randomly Interleaved Memories,” Proc. 18th Int'l Symp. Computer Architecture (ISCA-18), 1991.
[11] S. Sechrest, C. Lee, and T. Mudge, “Correlation and Aliasing in Dynamic Branch Predictors,” Proc. 23rd Int'l Symp. Computer Architecture (ISCA-23), 1996.
[12] A. Seznec, “An Optimized 2bcgskew Branch Predictor,” technical report, IRISA, 2003.
[13] P. Shivakumar and N. Jouppi, “CACTI 3.0: An Integrated Cache Timing, Power, and Area Model,” WRL Technical Report 2001/2, Aug. 2001.
[14] A. Talcott, M. Nemirovsky, and R. Wood, “The Influence of Branch Prediction Table Interference on Branch Prediction Scheme Performance,” Proc. Int'l Conf. Parallel Architectures and Compilation Techniques (PACT), 1995.
[15] N. Topham and A. Gonzalez, “Randomized Cache Placement for Eliminating Conflicts,” IEEE Trans. Computer, vol. 48, no. 2, Feb. 1999.
[16] L. Vintan and M. Iridon, “Toward a High Performance Neural Branch Predictor,” Proc. Int'l Joint Conf. Neural Networks, 1999.
[17] T.-Y. Yeh and Y. Patt, “Alternative Implementations of Two-Level Adaptive Branch Prediction,” Proc. 22nd Int'l Symp. Computer Architecture (ISCA-22), 1995.
[18] The First JILP Championship Branch Prediction, http://www.jilp.org/cbp, 2004.

Index Terms:
Processor architectures.
Citation:
Yi Ma, Hongliang Gao, Huiyang Zhou, "Using Indexing Functions to Reduce Conflict Aliasing in Branch Prediction Tables," IEEE Transactions on Computers, vol. 55, no. 8, pp. 1057-1061, Aug. 2006, doi:10.1109/TC.2006.133
Usage of this product signifies your acceptance of the Terms of Use.