loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'04)
Balanced Multithreading: Increasing Throughput via a Low Cost Multithreading Hierarchy
Portland,Oregon
December 04-December 08
ISBN: 0-7695-2126-6
Eric Tune, University of California at San Diego
Rakesh Kumar, University of California at San Diego
Dean M. Tullsen, University of California at San Diego
Brad Calder, University of California at San Diego
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.
Citation:
Eric Tune, Rakesh Kumar, Dean M. Tullsen, Brad Calder, "Balanced Multithreading: Increasing Throughput via a Low Cost Multithreading Hierarchy," micro, pp.183-194, 37th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.