Address-branch correlation: A novel locality for long-latency hard-to-predict branches

Proceedings - International Symposium on High-Performance Computer Architecture

Volumn , Issue , 2008, Pages 74-85

  Gao, Hongliang ^a   Ma, Yi ^a   Dimitrov, Martin ^a   Zhou, Huiyang ^a  

^a UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH MISPREDICTIONS; BRANCH PREDICTORS; CACHE MISSES; DATA ACCESSES; DATA VALUES; ENERGY CONSUMPTIONS; EXECUTION TIMES; KEY COMPONENTS; LARGE INSTRUCTION WINDOWS; LONG TIMES; MICRO-PROCESSORS; MODERN MICROPROCESSORS; PREDICTION TABLES; PROGRAM EXECUTIONS; SOME APPLICATIONS;

BENCHMARKING; COMPUTER ARCHITECTURE; COMPUTERS; FILE ORGANIZATION; MICROPROCESSOR CHIPS;

DATA STRUCTURES;

EID: 57749186684     PISSN: 15300897     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPCA.2008.4658629     Document Type: Conference Paper

References (21)

1. H. Akkary, R. Rajwar, and S. Srinivasan, Checkpoint processing and recovery: towards scalable large instruction window processors, MICRO-36, 2003.
2. D. Brooks, V. Tiwari, and M. Martonosi, Wattch: a framework for architectural-level power analysis and optimization, ISCA-27, 2000.
3. D. Burger and T. Austin, The SimpleScalar tool set, v2.0, Computer Architecture News, vol. 25, June 1997.
4. R. S. Chappell, F. Tseng, A. Yoaz, Y. N. Patt, Difficult-path branch prediction using subordinate microthreads, ISCA-29, 2002.
5. A. Cristal, D. Ortega, J. Llosa, and M. Valero, Out-of-order commit processors, HPCA-10, 2004.
6. D. Jimenez and C. Lin, Dynamic branch prediction with perceptrons, HPCA-7, 2001.
7. D. Jimenez and C. Lin, Neural methods for dynamic branch prediction, ACM Trans. on Computer Systems, 2002.
8. A. R. Lebeck, J. Koppanalil, T. Li, J. Patwardhan, and E. Rotenberg, A large, fast instruction window for tolerating cache misses, ISCA-29, 2002.
9. Y. Ma, H. Gao, M. Dimitrov, and H. Zhou, Optimizing dual-core execution for power efficiency and transient-fault recovery, IEEE Trans. on Parallel and Distributed Systems, 2007.
10. S. MacFarling, Combining branch predictors, Technical Report, DEC, 1993.
11. P. Michaud, A PPM-like, tag-based branch predictor, Journal of Instruction Level Parallelism, 2005.
12. A. Roth, G. S. Sohi, Speculative Data-Driven Multithreading, HPCA-7, 2001.
13. A. Seznec, P. Michaud. A case for (partially) tagged Geometric History Length Branch Prediction. Journal of Instruction Level Parallelism, vol. 8, February 2006.
14. A. Seznec. A 256 Kbits L-TAGE branch predictor. In The 2nd JILP Championship Branch Prediction Competition (CBP-2), 2006.
15. A. Seznec. Looking for limits in branch prediction with the GTL predictor. In The 2nd JILP Championship Branch Prediction Competition (CBP-2), 2006.
16. T. Sherwood, E. Perelman, G. Hamerly, and B. Calder, Automatically characterizing large scale program behavior, ASPLOS-X, 2002.
17. S. T. Srinivasan, R. Rajwar, H. Akkary, A. Gandhi, and M. Upton, Continual flow pipelines, ASPLOS-11, 2004.
18. L. Vintan, Towards a high performance neural branch predictor, IJCNN-99, 1999.
19. Y. Zhang, D. Parikh, K. Sankaranarayanan, K. Skadron, and M. Stan, Hotleakage: a temperature-aware model of sub-threshold and gate leakage for architects, Tech. Reports CS-2003-05, U. Va. Dept. of CS, 2003.
20. H. Zhou, Dual-core execution: building a highly scalable single-thread instruction window, PACT'05, 2005.
21. http://camino.rutgers.edu/cbp2/, the 2nd JILP Championship Branch Prediction Competition (CBP-2) official site, 2006.