The Community for Technology Leaders
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques (2003)
New Orleans, Louisiana
Sept. 27, 2003 to Oct. 1, 2003
ISSN: 1089-795X
ISBN: 0-7695-2021-9
pp: 15
Steven E. Raasch , University of Michigan
Steven K. Reinhardt , University of Michigan
ABSTRACT
<p>Simultaneous multithreading (SMT) increases processor throughput by multiplexing resources among several threads. Despite the commercial availability of SMT processors, several aspects of this resource sharing are not well understood. For example, academic SMT studies typically assume that resources are shared dynamically, while industrial designs tend to divide resources statically among threads.</p> <p>This study seeks to quantify the performance impact of resource partitioning policies in SMT machines, focusing on the execution portion of the pipeline. We find that for storage resources, such as the instruction queue and reorder buffer, statically allocating an equal portion to each thread provides good performance, in part by avoiding starvation. The enforced fairness provided by this partitioning obviates sophisticated fetch policies to a large extent. SMT?s potential ability to allocate storage resources dynamically across threads does not appear to be of significant benefit.</p> <p>In contrast, static division of issue bandwidth has a negative impact on throughput. SMT?s ability to multiplex bursty execution streams dynamically onto shared function units contributes to its overall throughput.</p> <p>Finally, we apply these insights to SMT support in clustered architectures. Assigning threads to separate clusters eliminates inter-cluster communication; however, in some circumstances, the resulting partitioning of issue bandwidth cancels out the performance benefit of eliminating communication.</p>
INDEX TERMS
null
CITATION
Steven E. Raasch, Steven K. Reinhardt, "The Impact of Resource Partitioning on SMT Processors", Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, vol. 00, no. , pp. 15, 2003, doi:10.1109/PACT.2003.1237998
94 ms
(Ver 3.3 (11022016))