Predictor virtualization

被引:11
作者
Burcea, Ioana [1 ]
Somogyi, Stephen [2 ]
Moshovos, Andreas [1 ]
Falsafi, Babak [2 ,3 ]
机构
[1] Univ Toronto, Dept Elect & Comp Engn, Toronto, ON M5S 1A1, Canada
[2] Carnegie Mellon Univ, Comp Architecture Lab CALCM, Pittsburgh, PA 15213 USA
[3] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci, CH-1015 Lausanne, Switzerland
关键词
performance; design; predictor virtualization; caches; memory hierarchy; metadata;
D O I
10.1145/1353536.1346301
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Many hardware optimizations rely on collecting information about program behavior at runtime. This information is stored in lookup tables. To be accurate and effective, these optimizations usually require large dedicated on-chip tables. Although technology advances offer an increased amount of on-chip resources, these resources are allocated to increase the size of on-chip conventional cache hierarchies. This work proposes Predictor Virtualization, a technique that uses the existing memory hierarchy to emulate large predictor tables. We demonstrate the benefits of this technique by virtualizing a state-of-the-art data prefetcher. Full-system, cycle-accurate simulations demonstrate that the virtualized prefetcher preserves the performance benefits of the original design, while reducing the on-chip storage dedicated to the predictor table from 60KB down to less than one kilobyte.
引用
收藏
页码:157 / 167
页数:11
相关论文
共 34 条
[1]  
Almog Y., 2004, P INT S COD GEN OPT
[2]  
Barham P., 2003, P 19 S OP SYST PRINC
[3]  
Barroso L. A., 2000, P INT S COMP ARCH
[4]  
CANTIN J. F., 2006, P 12 INT C ARCH SUPP
[5]  
Chaiken D., 1991, P INT C ARCH SUPP PR
[6]  
CLARK C, 2005, P 2 S NETW SYST DES
[7]  
COLLINS J, 2002, P 35 INT S MICR
[8]  
COOKSEY R, 2002, P 10 INT C ARCH SUPP
[9]  
EKMAN M, 2005, P INT S PERF AN SYST
[10]  
FERDMAN M, 2007, P INT S PERF AN SYST