Skip to main content

Applying Machine Learning for Ensemble Branch Predictors

  • Conference paper
  • First Online:
Developments in Applied Artificial Intelligence (IEA/AIE 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2358))

  • 1213 Accesses

Abstract

The problem of predicting the outcome of a conditional branch instruction is a prerequisite for high performance in modern processors. It has been shown that combining different branch predictors can yield more accurate prediction schemes, but the existing research only examines selection-based approaches where one predictor is chosen without considering the actual predictions of the available predictors. The machine learning literature contains many papers addressing the problem of predicting a binary sequence in the presence of an ensemble of predictors or experts. We show that the Weighted Majority algorithm applied to an ensemble of branch predictors yields a prediction scheme that results in a 5–11% reduction in mispredictions. We also demonstrate that a variant of the Weighted Majority algorithm that is simplified for efficient hardware implementation still achieves misprediction rates that are within 1.2% of the ideal case.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Todd M. Austin. SimpleScalar Hacker’s Guide (for toolset release 2.0). Technical report, SimpleScalar LLC. http://www.simplescalar.com/ docs/hack_guide_v2.pdf.

  2. James E. Bennett and Michael J. Flynn. Prediction Caches for Superscalar Processors. In Proceedings of the 30th International Symposium on Microarchitecture, 1997.

    Google Scholar 

  3. Avrim Blum. Empirical Support for Winnow and Weight-Majority Based Algorithms: Results on a Calendar Scheduling Domain. In Proceedings of the 12th International Conference on Machine Learning, pages 64–72, 1995.

    Google Scholar 

  4. Doug Burger and Todd M. Austin. The SimpleScalar Tool Set, Version 2.0. Technical Report 1342, University of Wisconsin, June 1997.

    Google Scholar 

  5. Brad Calder, Dirk Grunwalk, Michael Jones, Donald Lindsay, James Martin, Michael Mozer, and Benjamin Zorn. Evidence-Based Static Branch Prediction Using Machine Learning. ACM Transactions on Programming Languages and Systems, 19(1):188–222, 1997.

    Article  Google Scholar 

  6. George Z. Chrysos and Joel S. Emer. Memory Dependence Prediction Using Store Sets. In Proceedings of the 25th International Symposium on Computer Architecture, pages 142–153, 1998.

    Google Scholar 

  7. Adam A. Deaton and Rocco A. Servedio. Gene Structure Prediction From Many Attributes. Journal of Computational Biology, 2001.

    Google Scholar 

  8. Avinoam N. Eden and Trevor N. Mudge. The YAGS Branch Prediction Scheme. In Proceedings of the 31st International Symposium on Microarchitecture, pages 69–77, December 1998.

    Google Scholar 

  9. Joel Emer and Nikolas Gloy. A Language for Describing Predictors and it Application to Automatic Synthesis. In Proceedings of the 24th International Symposium on Computer Architecture, June 1997.

    Google Scholar 

  10. Marius Evers, Po-Yung Chang, and Yale N. Patt. Using Hybrid Branch Predictors to Improve Branch Prediction Accuracy in the Presence of Context Switches. In Proceedings of the 23rd International Symposium on Computer Architecture, May 1996.

    Google Scholar 

  11. Andrew R. Golding and Dan Roth. Applying Winnow to Context-Sensitive Spelling Correction. In Proceedings of the 13th International Conference on Machine Learning, pages 182–190, 1996.

    Google Scholar 

  12. Mark Herbster and Manfred Warmuth. Track the Best Expert. In Proceedings of the 34th International Conference on Machine Learning, pages 286–294, 1995.

    Google Scholar 

  13. Erik Jacobson, Eric Rotenberg, and James E. Smith. Assigning Confidence to Conditional Branch Predictions. In Proceedings of the 29th International Symposium on Microarchitecture, pages 142–152, December 1996.

    Google Scholar 

  14. Daniel A. Jiménez and Calvin Lin. Dynamic Branch Prediction with Perceptrons. In Proceedings of the 7th International Symposium on High Performance Computer Architecture, January 2001.

    Google Scholar 

  15. Daniel A. Jiménez and Calvin Lin. Perceptron Learning for Predicting the Behavior of Conditional Branches. In Proceedings of the, 2001.

    Google Scholar 

  16. R. E. Kessler. The Alpha 21264 Microprocessor. IEEE Micro Magazine, March-April 1999.

    Google Scholar 

  17. Chih-Chieh Lee, I-Cheng K. Chen, and Trevor N. Mudge. The Bi-Mode Branch Predictor. In Proceedings of the 30th International Symposium on Microarchitecture, pages 4–13, December 1997.

    Google Scholar 

  18. Mikko H. Lipasti, Christopher B. Wilkerson, and John Paul Shen. Value Locality and Load Value Prediction. In Proceedings of the Symposium on Architectural Support for Programming Languages and Operating Systems, October 1996.

    Google Scholar 

  19. Nick Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-threshold Algorithm. Machine Learning, 2:285–318, 1988.

    Google Scholar 

  20. Nick Littlestone and Manfred K. Warmuth. The Weighted Majority Algorithm. Information and Computation, 108:212–261, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  21. Scott McFarling. Combining Branch Predictors. TN 36, Compaq Computer Corporation Western Research Laboratory, June 1993.

    Google Scholar 

  22. Pierre Michaud, Andre Seznec, and Richard Uhlig. Trading Conflict and Capacity Aliasing in Conditional Branch Predictors. In Proceedings of the 24th International Symposium on Computer Architecture, 1997.

    Google Scholar 

  23. The Standard Performance Evaluation Corporation. WWW Site. http://www.spec.org.

  24. Volodya Vovk. Universal Forecasting Strategies. Information and Computation, 96:245–277, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loh, G.H., Henry, D.S. (2002). Applying Machine Learning for Ensemble Branch Predictors. In: Hendtlass, T., Ali, M. (eds) Developments in Applied Artificial Intelligence. IEA/AIE 2002. Lecture Notes in Computer Science(), vol 2358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48035-8_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-48035-8_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43781-9

  • Online ISBN: 978-3-540-48035-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics