Speculative updates of local and global branch history: A quantitative analysis

Journal of Instruction-Level Parallelism

Volumn 2, Issue , 2000, Pages

  Skadron, Kevin ^a   Martonosi, Margaret ^b   Clark, Douglas W ^b  

^a University of Virginia   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GLOBAL BRANCH HISTORY; GLOBAL-HISTORY PREDICTION; RUN-TIME BEHAVIOR; SPECULATIVE UPDATES;

APPROXIMATION THEORY; BEHAVIORAL RESEARCH; BENCHMARKING; COMPUTER HARDWARE; DATA ACQUISITION; INFORMATION RETRIEVAL; PROBLEM SOLVING; SOCIETIES AND INSTITUTIONS;

PROGRAM PROCESSORS;

EID: 0009582811     PISSN: None     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review

References (28)

1. T.-Y. Yeh and Y. N. Patt, "Alternative implementations of two-level adaptive branch prediction," in Proceedings of the 19th Annual International Symposium on Computer Architecture, pp. 124-34, May 1992.
2. J. E. Smith, "A study of branch prediction strategies," in Proceedings of the 8th Annual International Symposium on Computer Architecture, pp. 135-48, May 1981.
3. Digital Semiconductor, Alpha 21164 Microprocessor: Hardware Reference Manual, Apr. 1995.
4. MIPS Technologies, MIPS R10000 Microprocessor User's Manual, June 1995. Version 1.0.
5. K. Diefendorff, "K7 challenges Intel," Microprocessor Report, pp. 1, 6-11, Oct. 26 1998.
6. K. Diefendorff, "Athlon outruns Pentium III," Microprocessor Report, Aug. 23 1999.
7. P. Song, "UltraSparc-3 aims at MP servers" Microprocessor Report, pp. 29-34, Oct. 27 1997.
8. S. McFarling, "Combining branch predictors," Tech. Note TN-36, DEC WRL, June 1993.
9. L. Gwennap, "Intel's P6 uses decoupled superscalar design," Microprocessor Report, pp. 9-15, Feb. 16, 1995.
10. L. Gwennap, "Digital 21264 sets new standard," Microprocessor Report, pp. 11-16, Oct. 28, 1996.
11. R. E. Kessler, E. J. McLellan, and D. A. Webb, "The Alpha 21264 microprocessor architecture," in Proceedings of the 1998 International Conference on Computer Design, pp. 90-95, Oct. 1998.
12. P.-Y. Chang, E. Hao, and Y. N. Patt, "Alternative implementations of hybrid branch predictors," in 'Proceedings of the 28th Annual International Symposium on Microarchitecture, pp. 252-57, Dec. 1995.
13. A. R. Talcott, W. Yamamoto, M. J. Serrano, R. C. Wood, and M. Nemirovsky, "The impact of unresolved branches on branch prediction scheme performance," in Proceedings of the 21st Annual International Symposium on Computer Architecture, pp. 12-21, Apr. 1994.
14. E. Hao, P.-Y. Chang, and Y. Patt, "The effect of speculatively updating branch history on branch prediction accuracy, revisited," in Proceedings of the 27th Annual International Symposium on Microarchitecture, pp. 228-32, Nov. 1994.
15. S. Jourdan, J. Stark, T.-H. Hsing, and Y. N. Patt, "Recovery requirements of branch prediction storage structures in the presence of mispredicted-path execution," International journal of Parallel Programming, vol. 25, pp. 363-83, Oct. 1997.
16. M. G. Butler and Y. Patt, "A comparative performance evaluation of various state maintenance mechanisms," in Proceedings of the 26th Annual International Symposium on Microarchitecture, pp. 70-79, Dec. 1993.
17. K. Skadron, P. S. Ahuja, M. Martonosi, and D. W. Clark, "Improving prediction for procedure returns with return-address-stack repair mechanisms," in Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture, pp. 259-71, Dec. 1998.
18. The Standard Performance Evaluation Corporation, "SPEC CPU95 Benchmarks." WWW site: http://www.specbench.org/osg/cpu95, Dec. 1999.
19. D. Burger, T. M. Austin, and S. Bennett, "Evaluating future microprocessors: the SimpleScalar tool set," Tech. Report TR-1308, University of Wisconsin-Madison Computer Sciences Department, July 1996.
20. C. Price, MIPS IV Instruction Set, Revision 3.1. MIPS Technologies, Inc., Mountain View, CA, Jan. 1995.
21. B. Calder and D. Grunwald, "Fast & accurate instruction fetch and branch prediction," in Proceedings of the 21st Annual International Symposium on Computer Architecture, pp. 2-11, May 1994.
22. K. Skadron, P. S. Ahuja, M. Martonosi, and D. W. Clark, "Branch prediction, instruction-window size, and cache size: Performance tradeoffs and simulation techniques," IEEE Transactions on Computers, vol. 48, pp. 1260-81, Nov. 1999.
23. T.-Y. Yeh and Y. N. Part, "A comparison of dynamic branch predictors that use two levels of branch history," in Proceedings of the 20th Annual International Symposium on Computer Architecture, pp. 257-66, May 1993.
24. S. Kim and G. Tyson, "Analyzing the working set characteristics of branch execution," in Proceedings of the 31st Annual ACM/IEEE International Symposium on Microarchitecture, pp. 49-58, Dec. 1998.
25. P. S. Ahuja, K. Skadron, M. Martonosi, and D. W. Clark, "Multi-path execution: Opportunities and limits," in Proceedings of the 12th International Conference on Supercomputing, pp. 101-08, July 1998.
26. A. Klauser, V. Paithankar, and D. Grunwald, "Selective eager execution on the PolyPath Architecture," in Proceedings of the 25th Annual International Symposium on Computer Architecture, pp. 250-59, July 1998.
27. M. Evers, S. J. Patel, R. S. Chappell, and Y. N. Part, "An analysis of correlation and predictability: What makes two-level branch predictors work," in Proceedings of the 25th Annual International Symposium on Computer Architecture, pp. 52-61, June 1998.
28. K. Skadron, M. Martonosi, and D. W. Clark, "Alloying global and local branch history: A robust solution to wrong-history mispredictions," Tech. Report TR-606-99, Princeton University Department of Computer Science, Oct. 1999.