Methods for Modeling Resource Contention on Simultaneous Multithreading Processors

  • Authors:

  • Tipp Moseley;Dirk Grunwald;Joshua L. Kihm;Daniel A. Connors

  • Affiliations:

  • Department of Computer Science University of Colorado Boulder, CO;Department of Computer Science University of Colorado Boulder, CO;Department of Electrical and Computer Engineering, University of Colorado Boulder, CO;Department of Electrical and Computer Engineering, University of Colorado Boulder, CO

  • Venue:
  • ICCD '05 Proceedings of the 2005 International Conference on Computer Design
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Simultaneous multithreading (SMT) seeks to improve the computation throughput of a processor core by sharing primary resources such as functional units, issue bandwidth, and caches. SMT designs increase utilization and generally improve overall throughput, but the amount of improvement is highly dependent on competition for shared resources between the scheduled threads. This variability has implications that relate to operating system scheduling, simulation techniques, and fairness. Although these techniques recognize the implications of thread interaction, they do little to profile and predict this interaction. The modeling approach presented in this paper uses data collected from performance counters on two different hardware implementations of Pentium-4 Hyper-Threading processors to demonstrate the effects of thread interaction. Techniques are described for fitting linear regression models and recursive partitioning to use the counters to make online predictions of performance (expressed as instructions per cycle); these predictions can be used by the operating system to guide scheduling decisions. A detailed analysis of the effectiveness of each of these techniques is presented.