Adaptive set pinning: Managing shared caches in Chip Multiprocessors

被引:38
作者
Srikantaiah, Shekhar [1 ]
Kandemir, Mahmut [1 ]
Irwin, Mary Jane [1 ]
机构
[1] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
关键词
management; design; performance; experimentation; algorithms; shared cache; set pinning; CMP; inter-processor; intraprocessor;
D O I
10.1145/1353536.1346299
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
As part of the trend towards Chip Multiprocessors (CMPs) for the next leap in computing performance, many architectures have explored sharing the last level of cache among different processors for better performance-cost ratio and improved resource allocation. Shared cache management is a crucial CMP design aspect for the performance of the system. This paper first presents a new classification of cache misses - CII: Compulsory, Inter-processor and Intra-processor misses - for CMPs with shared caches to provide a better understanding of the interactions between memory transactions of different processors at the level of shared cache in a CMP. We then propose a novel approach, called set pinning, for eliminating inter-processor misses and reducing intra-processor misses in a shared cache. Furthermore, we show that an adaptive set pinning scheme improves over the benefits obtained by the set pinning scheme by significantly reducing the number of off-chip accesses. Extensive analysis of these approaches with SPEComp 2001 benchmarks is performed using a full system simulator. Our experiments indicate that the set pinning scheme achieves an average improvement of 22.18% in the L2 miss rate while the adaptive set pinning scheme reduces the miss rates by an average of 47.94% as compared to the traditional shared cache scheme. They also improve the performance by 7.24% and 17.88% respectively.
引用
收藏
页码:135 / 144
页数:10
相关论文
共 36 条
[1]  
[Anonymous], P 32 ANN INT S COMP
[2]  
[Anonymous], P 13 INT C PAR ARCH
[3]  
ASLOT V, 2001, P INT WORKSH OPENMP, P1
[4]  
Beckmann BM, 2004, INT SYMP MICROARCH, P319
[5]  
BECKMANN BM, 2006, P 39 ANN IEEE ACM IN
[6]  
CHANG J, 2007, P 21 ACM INT C SUP S
[7]  
CHANG J, 2006, P INT S COMP ARCH BO
[8]   Optimizing replication, communication, and capacity allocation in CMPs [J].
Chishti, Z ;
Powell, MD ;
Vijaykumar, TN .
32ND INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 2005, :357-368
[9]   Runtime identification of cache conflict misses: The adaptive miss buffer [J].
Collins, JD ;
Tullsen, DM .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2001, 19 (04) :413-439
[10]  
DUBOIS M, 1993, P 20 ANN INT S COMP, P88