Skip to main content

History Length Adjustable gshare Predictor for High-Performance Embedded Processor

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

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

Included in the following conference series:

  • 833 Accesses

Abstract

As modern microprocessros and embedded processors employ deeper pipelines and issue multiple instructions per cycle, accurate branch predictors become an essential part of processor architectures. In this paper, we introduce a history length adjustable gshare predictor for the high-performance embedded processors and show its low-level implementation. Compared to the previous gshare predictor, history length adjustable gshare predictor selectively utilizes the branch history, resulting in substantial improvement in branch prediction accuracy.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Furber, S.: ARM System-on-Chip Architecture, 2nd edn. Addison-Wesley, Reading (2000)

    Google Scholar 

  2. Intel XScale Core Developer’s Manual (January 2004)

    Google Scholar 

  3. Yeh, T.Y., Patt, Y.N.: Two-level adaptive branch prediction. In: Proceedings of the 24th ACM/IEEE International Symposium on Microarchitecture, pp. 51–61 (1991)

    Google Scholar 

  4. McFarling, S.: Combining branch predictors. Tech. Rep. TN-36m, Digital Western Research Lab. (June 1993)

    Google Scholar 

  5. Stark, J., Evers, M., Patt, Y.N.: Variable length path branch prediction. In: Proc. 8th Int’l Conf. on Architectural Support for Programming Languages and Operating Systems, pp. 170–179 (1998)

    Google Scholar 

  6. Tarlescu, M.-D., Theobald, K.B., Gao, G.R.: Elastic history buffer: A low-cost method to improve branch prediction accuracy. In: Proc. Int’l Conf. on Computer Design, pp. 82–87 (1997)

    Google Scholar 

  7. Juan, T., Sanjeevan, S., Navarro, J.J.: Dynamic history length fitting: A third level of adaptivity for branch prediction. In: Proc. 25th Int’l Symp. on Computer Architecture, pp. 155–166 (1998)

    Google Scholar 

  8. Kwak, J.W.: “Effective Input Vector Management to Improve Branch Prediction Accuracy”, Ph. D. Thesis, Department of EECS, Seoul National University (2006)

    Google Scholar 

  9. Burger, D., Austin, T.M., Bennett, S.: “Evaluating future micro-processors: the SimpleScalar tool set”, Tech. Report TR-1308, Univ. of Wisconsin-Madison Computer Sciences Dept. (1997)

    Google Scholar 

  10. SPEC CPU2000 Benchmarks, http://www.specbench.org

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kwak, J.W., Jhang, S.T., Jhon, C.S. (2006). History Length Adjustable gshare Predictor for High-Performance Embedded Processor. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3983. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751632_69

Download citation

  • DOI: https://doi.org/10.1007/11751632_69

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34077-5

  • Online ISBN: 978-3-540-34078-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics