Skip to main content

History-Based Predictive Instruction Window Weighting for SMT Processors

  • Conference paper
  • 2622 Accesses

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

Abstract

In a Simultaneous Multi-Threaded (SMT) processor environment, threads share datapath resources, and resource allocation policy directly affects the throughput metric. As a way of explicit resource management, resource requirements of threads are estimated based on several runtime statistics, such as cache miss counts, Issue Queue usage and efficiency metrics. Controlling processor resources indirectly by means of a fetch policy is also targeted in many recent studies. A successful technique, Speculative Instruction Window Weighting (SIWW), which speculates the weights of instructions in Issue Queue to indirectly manage SMT resource usage, is recently proposed. SIWW promises better peformance results compared to the well-accepted ICOUNT fetch policy. In this study, we propose an alternative fetch policy that implements SIWW-like logic using a history-based prediction mechanism, History-based Predictive Instruction Window Weighting (HPIWW), avoiding any types of speculation hardware and its inherent complexity. As a result, we show that HPIWW outperforms SIWW by 3% on the average across all simulated workloads, and dissipates 2.5 times less power than its rival.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cazorla, F.J., Ramirez, A., Valero, M., Fernandez, E.: Dynamically Controlled Resource Allocation in SMT Processors, pp. 171–182. IEEE MICRO (2004)

    Google Scholar 

  2. Choi, S., Yeung, D.: Learning-Based SMT Processor Resource Distribution via Hill-Climbing. In: International Symposium on Computer Architecture (ISCA), pp. 239–251. ACM Press, New York (2006)

    Chapter  Google Scholar 

  3. Wang, H., Koren, I., Krishna, C.M.: An Adaptive Resource Partitioning Algorithm for SMT Processors. In: International Conference on Parallel Architectures and Compilation Techniques (PACT), pp. 230–239. ACM Press (2008)

    Google Scholar 

  4. Vandierendonck, H., Seznec, A.: Managing SMT Resource Usage through Speculative Instruction Window Weighting. Transactions on Architecture and Code Optimization (TACO) 8(3), 12 (2011)

    Google Scholar 

  5. Tullsen, D.M., Eggers, S.J., Emer, J.S., Levy, H.M., Lo, J.L., Stamm, R.L.: Exploiting choice: Instruction fetch and issue on an implementable simultaneous multithreading processor. ACM SIGARCH Computer Architecture News 24(2), 191–202 (1996)

    Article  Google Scholar 

  6. Tullsen, D.M., Jeffery, A.B.: Handling long-latency loads in a simultaneous multithreading processor. In: 34th Annual ACM/IEEE International Symposium on Microarchitecture, pp. 318–327. IEEE Computer Society Press (2001)

    Google Scholar 

  7. Feliu, J., Sahuquillo, J., Petit, S., Duato, J.: L1-bandwidth aware thread allocation in multicore SMT processors. In: Parallel Architectures and Compilation Techniques (PACT), pp. 123–132 (2013)

    Google Scholar 

  8. Kucuk, G., Mesta, M.: Energy savings in simultaneous multi-threaded processors through dynamic resizing of datapath resources. Turkish Journal of Electrical Engineering and Computer Sciences 20(1), 125–139 (2012)

    Google Scholar 

  9. Eyerman, S., Eeckhout, L.: Probabilistic modeling for job symbiosis scheduling on SMT processors. Transactions on Architecture and Code Optimization 9(2), art. no. 7 (2012)

    Google Scholar 

  10. Sharkey, J.J., Ponomarev, D., Ghose, K.: M-SIM: A Flexible, Multithreaded Architectural Simulation Environment. Department of Computer Science, Binghamton University, Technical Report No.CS-TR-05-DP01 (2005)

    Google Scholar 

  11. Brooks, D., Tiwari, V., Martonosi, M.: Wattch: A Framework for Architectural-Level Power Analysis Optimizations. In: International Symposium on Computer Architecture (ISCA), pp. 83–94. ACM Press, New York (2000)

    Google Scholar 

  12. Wilton, S.J.E., Jouppi, N.P.: CACTI: An Enhanced Cache Access and Cycle Time Model. IEEE Journal of Solid-State Circuits 31(5), 677–688 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kucuk, G., Uslu, G., Yesil, C. (2014). History-Based Predictive Instruction Window Weighting for SMT Processors. In: Kunkel, J.M., Ludwig, T., Meuer, H.W. (eds) Supercomputing. ISC 2014. Lecture Notes in Computer Science, vol 8488. Springer, Cham. https://doi.org/10.1007/978-3-319-07518-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07518-1_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07517-4

  • Online ISBN: 978-3-319-07518-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics