Skip to main content

Unbiased Branches: An Open Problem

  • Conference paper
Advances in Computer Systems Architecture (ACSAC 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4697))

Included in the following conference series:

  • 908 Accesses

Abstract

The majority of currently available dynamic branch predictors base their prediction accuracy on the previous k branch outcomes. Such predictors sustain high prediction accuracy but they do not consider the impact of unbiased branches, which are difficult-to-predict. In this paper, we evaluate the impact of unbiased branches in terms of prediction accuracy on a range of branch difference predictors using prediction by partial matching, multiple Markov prediction and neural-based prediction. Since our focus is on the impact that unbiased branches have on processor performance, timing issues and hardware costs are out of scope of this investigation. Our simulation results, with the SPEC2000 integer benchmark suite, are interesting even though they show that unbiased branches still restrict the ceiling of branch prediction and therefore accurately predicting unbiased branches remains an open problem.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Vintan, L., Gellert, A., Florea, A., Oancea, M., Egan, C.: Understanding Prediction Limits through Unbiased Branches. In: Jesshope, C., Egan, C. (eds.) ACSAC 2006. LNCS, vol. 4186, pp. 480–487. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. SPEC2000, The SPEC benchmark programs, http://www.spec.org

  3. Smith, Z.: Using Data Values to Aid Branch-Prediction, MSc Thesis, Wisconsin-Madison, USA, pp. 1–103 (1998)

    Google Scholar 

  4. Heil, T.H., Smith, Z., Smith, J.E.: Improving Branch Predictors by Correlating on Data Values. In: The 32nd International Symposium on Microarchitecture, pp. 28–37 (1999)

    Google Scholar 

  5. González, J., González, A.: Control-Flow Speculation through Value Prediction. IEEE Transactions on Computers 50(12), 1362–1376 (2001)

    Article  Google Scholar 

  6. Vintan, L., Sbera, M., Mihu, I.Z., Florea, A.: An Alternative to Branch Prediction. ACM SIGARCH Computer Architecture News 31(3), 20–29 (2003)

    Article  Google Scholar 

  7. Gao, H., Zhou, H.: Prediction by Combining Multiple Partial Matches. In: CBP-2. The 2nd Journal of Instruction-Level Parallelism Championship Branch Prediction Competition, Orlando, Florida, USA, pp. 19–24 (2006)

    Google Scholar 

  8. Gellert, A.: Prediction Methods Integrated into Advanced Architectures, Technical Report, Computer Science Department, ”Lucian Blaga” University of Sibiu, pp. 37–70 (2006)

    Google Scholar 

  9. Jiménez, D., Lin, C.: Dynamic Branch Prediction with Perceptron. In: HPCA-7. Proceedings of the Seventh International Symposium on High Performance Computer Architecture, pp. 197–206 (2001)

    Google Scholar 

  10. Jiménez, D., Lin, C.: Neural Methods for Dynamic Branch Prediction. ACM Transactions on Computer Systems 20(4), 369–397 (2002)

    Article  Google Scholar 

  11. Jiménez, D.: Idealized Piecewise Linear Branch Prediction. Journal of Instruction-Level Parallelism 7, 1–11 (2005)

    Google Scholar 

  12. Gellert, A.: Integration of some advanced prediction methods into speculative computing systems, Technical Report, Computer Science Department, ”Lucian Blaga” University of Sibiu, pp. 1–40 (2007)

    Google Scholar 

  13. Sazeides, Y., Smith, J.E.: The Predictability of Data Values. In: Proceedings of the 30th Annual International Symposium on Microarchitecture, pp. 248–258 (1997)

    Google Scholar 

  14. Simplescalar. The SimpleSim Tool Set ftp://ftp.cs.wisc.edu/pub/sohi/Code/simplescalar

  15. Bousias, K., Hasasneh, N., Jesshope, C.: Instruction Level Parallelism through Microthreading—A Scalable Approach to Chip Multiprocessors. The Computer Journal 49(2), 211–232 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Lynn Choi Yunheung Paek Sangyeun Cho

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gellert, A., Florea, A., Vintan, M., Egan, C., Vintan, L. (2007). Unbiased Branches: An Open Problem. In: Choi, L., Paek, Y., Cho, S. (eds) Advances in Computer Systems Architecture. ACSAC 2007. Lecture Notes in Computer Science, vol 4697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74309-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74309-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74308-8

  • Online ISBN: 978-3-540-74309-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics