Double Priority Based Simultaneous Multi-Threading Scheduling Strategy

Chapter
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 128)

Abstract

Fetch policy is very important to the system’s throughput and fairness in SMT (Simultaneous Multi-Threading) processor. However, most of the existing SMT fetch strategies separately focus on overall system throughput or thread fairness. In this paper, a new double priority based scheduling strategy (DPSS) is proposed. DPSS takes both throughput and fairness into consideration. And this strategy is based on the standard ICOUNT strategy and FAIR strategy while introduces a L2 cache detector. This new strategy runs threads of simultaneous multi-threading fairly with no loss of processor throughput.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tullsen, D.M.: Simulation and modeling of a simultaneous multithreading processor. In: Proceedings of the 22nd Annual Computer Measurement Group Conference, pp. 819–828 (1996)Google Scholar
  2. 2.
    Henning, J.L.: SPEC CPU2000:Measuring CPU performance in the new millennium. IEEE Computer 33(7), 28–35 (2000)CrossRefGoogle Scholar
  3. 3.
    Luo, K., Gummaraju, J., Franklin, M.: Balancing throughput and fairness in SMT processors. In: Proceedings of the International Symposium on Performance Analysis of Systems and Software, Tucson, USA, pp. 164–171 (2001)Google Scholar
  4. 4.
    Perelman, E., Hamerly, G., Biesbrouck, M.V., et al.: Using SimPoint for Accurate and Efficient Simulation. ACM SIGMETRICS Performance Evaluation Review 31(1), 318–319 (2003)CrossRefGoogle Scholar
  5. 5.
    Liu, Q., Yang, H., Wu, Y.: Simultaneous Multithreading Technology. Computer Engineering and Design 29(4) (2008)Google Scholar
  6. 6.
    Eggers, S.J., Emer, J.S., Levy, H.M., Lo, J.L., Stamm, R.L., Tullsen, D.M.: Simultaneous Multithreading: A Platform for Next-Generation Processors. IEEE Micro. 17(5), 12–19 (1997)CrossRefGoogle Scholar
  7. 7.
    Sun, C.-X., Zhang, M.-X.: Co-Scheduling Threads in SMT Processors Fairly. Acta Electronic Science (February 2008)Google Scholar
  8. 8.
    Tullsen, D., Eggers, S., Emer, J., et al.: Exploiting Choice: Instruction Fetch and Issue on An Implementable Simultaneous Multithreading Processor. In: Proceedings of the 23rd Annual International Symposium on Computer Architecture, PA, USA, May 1996, pp. 191–202 (1996)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Computer Science and Engineering DepartmentSoutheast UniversityNanjingChina

Personalised recommendations