Balanced multithreading: Increasing throughput via a low cost multithreading hierarchy

  • Tune E
  • Kumar R
  • Tullsen D
 et al. 
  • 21

    Readers

    Mendeley users who have this article in their library.
  • 28

    Citations

    Citations of this article.

Abstract

A simultaneous multithreading (SMT) processor can issue instructions from several threads every cycle, allowing it to effectively hide various instruction latencies; this effect increases with the number of simultaneous contexts supported. However, each added context on an SMT processor incurs a cost in complexity, which may lead to an increase in pipeline length or a decrease in the maximum clock rate. This paper presents new designs for multithreaded processors which combine a conservative SMT implementation with a coarse-grained multithreading capability. By presenting more virtual contexts to the operating system and user than are supported in the core pipeline, the new designs can take advantage of the memory parallelism present in workloads with many threads, while avoiding the performance penalties inherent in a many-context SMT processor design. A design with 4 virtual contexts, but which is based on a 2-context SMT processor core, gains an additional 26% throughput when 4 threads are run together.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Eric Tune

  • Rakesh Kumar

  • Dean M. Tullsen

  • Brad Calder

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free