Energy Efficient Last Level Caches via Last Read/Write Prediction

被引:3
作者
Alves, Marco A. Z. [1 ]
Villavieja, Carlos [2 ]
Diener, Matthias [1 ]
Navaux, Philippe O. A. [1 ]
机构
[1] Univ Fed Rio Grande do Sul, Inst Informat, Porto Alegre, RS, Brazil
[2] Univ Texas Austin, Dept Elect & Comp Engn, Austin, TX USA
来源
2013 25TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD) | 2013年
关键词
D O I
10.1109/SBAC-PAD.2013.12
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The size of the Last Level Caches (LLC) in multicore architectures is increasing, and so is their power consumption. However, most of this power is wasted on unused or invalid cache lines. For dirty cache lines, the LLC waits until the line is evicted to be written back to memory. Hence, dirty lines compete for the memory bandwidth with read requests (prefetch and demand), increasing pressure on the memory controller. This paper proposes a Dead Line and Early Write-Back Predictor (DEWP) to improve the energy efficiency of the LLC. DEWP early evicts dead cache lines with an average accuracy of 94%, and only 2% false positives. DEWP also allows scheduling of dirty lines for early eviction, allowing earlier write-backs. Using DEWP over a set of single and multi-threaded benchmarks, we obtain an average of 61% static energy savings, while maintaining the performance, for both inclusive and non-inclusive LLCs.
引用
收藏
页码:73 / 80
页数:8
相关论文
共 18 条
[1]  
Abella Jaume, 2005, ACM Trans. Archit. Code Optim., V1, P55, DOI [10.1145/1061267.1061271, DOI 10.1145/1061267.1061271]
[2]  
Alves M. A. Z., 2012, 2012 24th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD 2012), P51, DOI 10.1109/SBAC-PAD.2012.30
[3]  
[Anonymous], 1991, TECHNICAL REPORT
[4]   Accurate and complexity-effective spatial pattern prediction [J].
Chen, CF ;
Yang, SH ;
Falsafi, B ;
Moshovos, A .
10TH INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 2004, :276-287
[5]  
Esmaeilzadeh H, 2011, ISCA 2011: PROCEEDINGS OF THE 38TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, P365, DOI 10.1145/2024723.2000108
[6]  
Kaxiras S, 2001, ACM COMP AR, P240, DOI 10.1109/ISCA.2001.937453
[7]   Using Dead Blocks as a Virtual Victim Cache [J].
Khan, Samira ;
Jimenez, Daniel A. ;
Burger, Doug ;
Falsafi, Babak .
PACT 2010: PROCEEDINGS OF THE NINETEENTH INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, 2010, :489-500
[8]   Counter-based cache replacement and bypassing algorithms [J].
Kharbutli, Mazen ;
Solihin, Yan .
IEEE TRANSACTIONS ON COMPUTERS, 2008, 57 (04) :433-447
[9]   Exploiting spatial locality in data caches using spatial footprints [J].
Kumar, S ;
Wilkerson, C .
25TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 1998, :357-368
[10]   Dead-Block Prediction & Dead-Block Correlating Prefetchers [J].
Lai, AC ;
Fide, C ;
Falsafi, B .
28TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 2001, :144-154