DocumentCode :
2845675
Title :
Two-Level Reorder Buffers: Accelerating Memory-Bound Applications on SMT Architectures
Author :
Loew, Jason ; Ponomarev, Dmitry
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York at Binghamton, Binghamton, NY
fYear :
2008
fDate :
9-12 Sept. 2008
Firstpage :
182
Lastpage :
189
Abstract :
We propose a low complexity mechanism for accelerating memory-bound threads on SMT processors without adversely impacting the performance of other concurrently running applications. The main idea is to provide a two-level organization of the Reorder Buffer (ROB), where the first level is comprised of small private per-thread ROBs which are used in the normal course of execution in the absence of last level cache misses. The second ROB level is a much larger storage that can be used on demand by threads experiencing last level cache misses. The key feature of our scheme is that the allocation of the second-level ROB partition occurs to a thread experiencing a miss into the last level cache only if the number of instructions dependent on the missing load is below a predetermined threshold. We introduce a novel low-complexity mechanism to count the number of load-dependent instructions and propose two schemes for allocating second level ROB: predictive and reactive. Our results demonstrate about 30% improvement over DCRA resource distribution mechanism in terms of "harmonic mean of weighted IPCs" metric.
Keywords :
buffer storage; multi-threading; parallel architectures; SMT architecture; last level cache misses; load-dependent instructions; low complexity mechanism; memory-bound application; memory-bound threads; second-level ROB partition; two-level reorder buffers; Acceleration; Application software; Counting circuits; Degradation; Parallel processing; Registers; Resource management; Surface-mount technology; Throughput; Yarn;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing, 2008. ICPP '08. 37th International Conference on
Conference_Location :
Portland, OR
ISSN :
0190-3918
Print_ISBN :
978-0-7695-3374-2
Electronic_ISBN :
0190-3918
Type :
conf
DOI :
10.1109/ICPP.2008.24
Filename :
4625848
Link To Document :
بازگشت