Branch prediction using profile data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2150, Issue , 2001, Pages 386-394

  Ramirez, Alex ^a   Larriba Pey, Josep L ^a   Valero, Mateo ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS;

BRANCH PREDICTION; COMPILER TRANSFORMATIONS; LARGE INSTRUCTION WINDOW; PREDICTION ACCURACY; PROFILE DATA; SUPERSCALAR PROCESSOR;

FORECASTING;

EID: 84937433634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44681-8_57     Document Type: Conference Paper

References (26)

1. Thomas Ball and James R. Larus. Branch prediction for free. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 300–313, June 1993.
2. D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: the simplescalar tool set. Technical Report TR-1308, University of Winsconsin, July 1996.
3. Brad Calder and Dirk Grunwald. Reducing branchcost s via branchalign ment. Proceedings of the 6th Intl. Conference on Architectural Support for Programming Languages and Operating Systems, pages 242–251, October 1994.
4. Brad Calder, Dirk Grunwald, and Donald Lindsay. Corpus-based static branch prediction. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 79–92, 1995.
5. Po-Yung Chang, Marius Evers, and Yale N. Patt. Improving branch prediction accuracy by reducing pattern history table interference. Proceedings of the Intl. Conference on Parallel Architectures and Compilation Techniques, October 1996.
6. Po-Yung Chang, Eric Hao, Tse-Yu Yeh, and Yale N. Patt. Branch classification: a new mechanism for improving branch predictor performance. Proceedings of the 27th Annual ACM/IEEE Intl. Symposium on Microarchitecture, pages 22–31, 1994.
7. A. N. Eden and Trevor N. Mudge. The yags branch prediction scheme. Proceedings of the Intl. Conference on Parallel Architectures and Compilation Techniques, pages 69–77, 1998.
8. Joseph A. Fisher. Trace scheduling: A technique for global microcode compaction. IEEE Transactions on Computers, 30(7):478–490, July 1981.
9. JosephA. Fisher and Stefan M. Freudenberger. Predicting conditional branch directions from previous runs of a program. Proceedings of the 5th Intl. Conference on Architectural Support for Programming Languages and Operating Systems, pages 85–95, 1992.
10. Dirk Grunwald, Donald Lindsay, and Benjamin Zorn. Static methods in hybrid branchpre diction. Proceedings of the Intl. Conference on Parallel Architectures and Compilation Techniques, pages 222–229, 1998.
11. Andreas Krall. Improving semi-static branchp rediction by code replication. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 97–106, 1994.
12. Chih-Chieh Lee, I-Cheng K. Chen, and Trevor N. Mudge. The bi-mode branch predictor. Proceedings of the 30th Annual ACM/IEEE Intl. Symposium on Microarchitecture, pages 4–13, December 1997.
13. Dondald Lindsay. Static methods in branch prediction. Ph. D. thesis, Department of Computer Science, University of Colorado, 1998.
14. Scott McFarling. Combining branchp redictors. Technical Report TN-36, Compaq Western ResearchL ab., June 1993.
15. Scott McFarling and John Hennessy. Reducing the cost of branches. Proceedings of the 13th Annual Intl. Symposium on Computer Architecture, pages 396–403, 1986.
16. Pierre Michaud, Andre Seznec, and Richard Uhlig. Trading conflict and capacity aliasing in conditional branchpre dictors. Proceedings of the 24th Annual Intl. Symposium on Computer Architecture, pages 292–303, 1997.
17. Frank Mueller and David A. Whalley. Avoiding conditional branches by code replication. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 56–66, 1995.
18. Ravi Nair. Dynamic path-based branch correlation. Proceedings of the 28th Annual ACM/IEEE Intl. Symposium on Microarchitecture, pages 15–23, November 1995.
19. Sanjay Jeram Patel, Marius Evers, and Yale N. Patt. Improving trace cache effectiveness withb ranch promotion and trace packing. Proceedings of the 25th Annual Intl. Symposium on Computer Architecture, pages 262–271, June 1998.
20. Harish Patil and Joel Emer. Combining static and dynamic branchp rediction to reduce destructive aliasing. Proceedings of the 6th Intl. Conference on High Performance Computer Architecture, pages 251–262, January 2000.
21. Jason R. C. Patterson. Accurate static branchp rediction by value range propagation. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 67–78, 1995.
22. Alex Ramirez, Josep L. Larriba-Pey, and Mateo Valero. The effect of code reordering on branchpre diction. Proceedings of the Intl. Conference on Parallel Architectures and Compilation Techniques, pages 189–198, October 2000.
23. James E. Smith. A study of branch prediction strategies. Proceedings of the 8th Annual Intl. Symposium on Computer Architecture, pages 135–148, 1981.
24. Eric Sprangle, Robert S. Chappell, Mitch Alsup, and Yale N. Patt. The agree predictor: A mechanism for reducing negative branch history interference. Proceedings of the 24th Annual Intl. Symposium on Computer Architecture, pages 284–291, 1997.
25. T. Y. Yehan d Y. N. Patt. Two-level adaptive branch prediction. Proceedings of the 24th Annual ACM/IEEE Intl. Symposium on Microarchitecture, pages 51–61, 1991.
26. Cliff Young and Michael D. Smith. Improving the accuracy of static branch prediction using branchcorrelation. Proceedings of the 6th Intl. Conference on Architectural Support for Programming Languages and Operating Systems, pages 232–241, October 1994.