Skip to main content

A Low-Complexity Issue Queue Design with Speculative Pre-execution

  • Conference paper
High Performance Computing – HiPC 2005 (HiPC 2005)

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

Included in the following conference series:

  • 625 Accesses

Abstract

Current superscalar architectures inherently depend on an instruction issue queue to achieve multiple instruction issue and out-of-order execution. However, the issue queue is implemented as a centralized structure and mainly causes globally broadcasting operations to wake up and select the instructions. Therefore, a large issue queue ultimately results in a low clock rate along with a high circuit complexity. This paper proposes Speculative Pre-Execution Assisted by compileR (SPEAR), a low-complexity issue queue design. SPEAR is designed to manage the small issue queue more efficiently without increasing the queue size. To this end, we have first recognized that the long memory latency is one of the factors which demand a large queue, and we aim at achieving early execution of the miss-causing load instructions using another hierarchy of an issue queue. We speculatively pre-execute those miss-causing instructions as an additional prefetching thread.

This paper is based upon work supported in part by NSF grants CCR-0234444 and INT-0223647. Any opinions, findings, and conclusions or recommendations are those of the authors and do not necessarily reflect the views of NSF.

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. Palacharla, S., Jouppi, N.P., Smith, J.E.: Complexity-effective superscalar processors. In: Proceedings of the 24th Annual International Symposium on Computer Architecture (1997)

    Google Scholar 

  2. Agarwal, V., Murukkathampoondi, H.S., Keckler, S.W., Burger, D.C.: Clock rate versus IPC: The end of the road for conventional microarchitectures. In: Proceedings of the 27th Annual International Symposium on Computer Architecture (2000)

    Google Scholar 

  3. Burger, D., Austin, T.: The SimpleScalar tool set. Technical Report CS-TR-97-1342, University of Wisconsin-Madison (1996)

    Google Scholar 

  4. Farkas, K.I., Chow, P., Jouppi, N.P., Vranesic, Z.: The multicluster architecture: Reducing cycle time through partitioning. In: Proceedings of the 30th Annual International Symposium on Microarchitecture (1997)

    Google Scholar 

  5. Krishnan, V., Torrellas, J.: A chip-multiprocessor architecture with speculative multithreading. IEEE Transactions on Computers 48 (1999)

    Google Scholar 

  6. Marcuello, P., González, A.: Clustered speculative multithreaded processors. In: Proceedings of the 13th International Conference on Supercomputing (1999)

    Google Scholar 

  7. Sohi, G.S., Breach, S.E., Vijaykumar, T.N.: Multiscalar processors. In: Proceedings of the 22nd Annual International Symposium on Computer Architecture (1995)

    Google Scholar 

  8. Annavaram, M., Patel, J.M., Davidson, E.S.: Data prefetching by dependence graph precomputation. In: Proceedings of the 28th Annual International Symposium on Computer Architecture (2001)

    Google Scholar 

  9. Collins, J.D., Wang, H., Tullsen, D.M., Hughes, C., Lee, Y.F., Lavery, D., Shen, J.P.: Speculative precomputation: Long-range prefetching of delinquent loads. In: Proceedings of the 28th Annual International Symposium on Computer Architecture (2001)

    Google Scholar 

  10. Kim, D., Yeung, D.: Design and evaluation of compiler algorithms for pre-execution. In: Proceedings of the 10th International Conference on Architectural Support for Programming Languages and Operating Systems (2002)

    Google Scholar 

  11. Luk, C.K.: Tolerating memory latency through software-controlled pre-execution in simultaneous multithreading processor. In: Proceedings of the 28th Annual International Symposium on Computer Architecture (2001)

    Google Scholar 

  12. Liao, S.S.W., Wang, P.H., Wang, H., Hoflehner, G., Lavery, D., Shen, J.P.: Post-pass binary adaptation for software-based speculative precomputation. In: Proceedings of the Programming Language Design and Implementation (2002)

    Google Scholar 

  13. Ro, W.W., Gaudiot, J.L.: SPEAR: A hybrid model for speculative pre-execution. In: Proceedings of the 18th International Parallel and Distributed Processing Symposium (2004)

    Google Scholar 

  14. Roth, A., Sohi, G.S.: Speculative data-driven multithreading. In: Proceedings of the 7th International Symposium on High Performance Computer Architecture (2001)

    Google Scholar 

  15. Zilles, C.B., Sohi, G.S.: Execution-based prediction using speculative slices. In: Proceedings of the 28th Annual International Symposium on Computer Architecture (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ro, W.W., Gaudiot, JL. (2005). A Low-Complexity Issue Queue Design with Speculative Pre-execution. In: Bader, D.A., Parashar, M., Sridhar, V., Prasanna, V.K. (eds) High Performance Computing – HiPC 2005. HiPC 2005. Lecture Notes in Computer Science, vol 3769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602569_38

Download citation

  • DOI: https://doi.org/10.1007/11602569_38

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-32427-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics