Lifetime-aware LRU promotion policy for last-level cache

Hong Yi Wu; Chien Chih Chen; Hsiang Jen Tsai; Yin Chi Peng; Tien-Fu Chen

doi:10.1109/VLSI-DAT.2015.7114579

Lifetime-aware LRU promotion policy for last-level cache

Hong Yi Wu, Chien Chih Chen, Hsiang Jen Tsai, Yin Chi Peng, Tien-Fu Chen

Institute of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

The traditional LRU replacement policy is susceptible to memory-intensive workloads with large non-reused data like thrashing applications and scan applications. For such workloads, the majority of cache blocks don't get any cache hits during residing in the cache. Cache performance can be improved by reducing the interference from non-reused data. Therefore, the lifetime of other blocks is increased and it can contribute to cache hit. We propose a Lifetime-aware LRU Promotion Policy and show that changing the promotion policy can effective reduce cache miss in the last-level cache. Our promotion policy dynamically adjusts promotion strategy and increases the lifetime for useful cache blocks. The experimental results show that our proposal reduces the average MPKI by 6% and 9% over EAF and DIP, respectively. In multicore, we also improve the performance and reduce the MPKI.

Original language	English
Title of host publication	2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781479962754
DOIs	https://doi.org/10.1109/VLSI-DAT.2015.7114579
State	Published - 28 May 2015
Event	2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015 - Hsinchu, Taiwan Duration: 27 Apr 2015 → 29 Apr 2015

Publication series

Name	2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015

Conference

Conference	2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015
Country/Territory	Taiwan
City	Hsinchu
Period	27/04/15 → 29/04/15

Access to Document

10.1109/VLSI-DAT.2015.7114579

Cite this

Wu, H. Y., Chen, C. C., Tsai, H. J., Peng, Y. C., & Chen, T.-F. (2015). Lifetime-aware LRU promotion policy for last-level cache. In 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015 Article 7114579 (2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/VLSI-DAT.2015.7114579

@inproceedings{0a6643e8ae124db9a1cc49a3c8f84417,

title = "Lifetime-aware LRU promotion policy for last-level cache",

abstract = "The traditional LRU replacement policy is susceptible to memory-intensive workloads with large non-reused data like thrashing applications and scan applications. For such workloads, the majority of cache blocks don't get any cache hits during residing in the cache. Cache performance can be improved by reducing the interference from non-reused data. Therefore, the lifetime of other blocks is increased and it can contribute to cache hit. We propose a Lifetime-aware LRU Promotion Policy and show that changing the promotion policy can effective reduce cache miss in the last-level cache. Our promotion policy dynamically adjusts promotion strategy and increases the lifetime for useful cache blocks. The experimental results show that our proposal reduces the average MPKI by 6% and 9% over EAF and DIP, respectively. In multicore, we also improve the performance and reduce the MPKI.",

author = "Wu, {Hong Yi} and Chen, {Chien Chih} and Tsai, {Hsiang Jen} and Peng, {Yin Chi} and Tien-Fu Chen",

year = "2015",

month = may,

day = "28",

doi = "10.1109/VLSI-DAT.2015.7114579",

language = "English",

series = "2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015",

address = "美國",

note = "2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015 ; Conference date: 27-04-2015 Through 29-04-2015",

}

Wu, HY, Chen, CC, Tsai, HJ, Peng, YC & Chen, T-F 2015, Lifetime-aware LRU promotion policy for last-level cache. in 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015., 7114579, 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015, Institute of Electrical and Electronics Engineers Inc., 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015, Hsinchu, Taiwan, 27/04/15. https://doi.org/10.1109/VLSI-DAT.2015.7114579

Lifetime-aware LRU promotion policy for last-level cache. / Wu, Hong Yi; Chen, Chien Chih; Tsai, Hsiang Jen et al.
2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. 7114579 (2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Lifetime-aware LRU promotion policy for last-level cache

AU - Wu, Hong Yi

AU - Chen, Chien Chih

AU - Tsai, Hsiang Jen

AU - Peng, Yin Chi

AU - Chen, Tien-Fu

PY - 2015/5/28

Y1 - 2015/5/28

N2 - The traditional LRU replacement policy is susceptible to memory-intensive workloads with large non-reused data like thrashing applications and scan applications. For such workloads, the majority of cache blocks don't get any cache hits during residing in the cache. Cache performance can be improved by reducing the interference from non-reused data. Therefore, the lifetime of other blocks is increased and it can contribute to cache hit. We propose a Lifetime-aware LRU Promotion Policy and show that changing the promotion policy can effective reduce cache miss in the last-level cache. Our promotion policy dynamically adjusts promotion strategy and increases the lifetime for useful cache blocks. The experimental results show that our proposal reduces the average MPKI by 6% and 9% over EAF and DIP, respectively. In multicore, we also improve the performance and reduce the MPKI.

AB - The traditional LRU replacement policy is susceptible to memory-intensive workloads with large non-reused data like thrashing applications and scan applications. For such workloads, the majority of cache blocks don't get any cache hits during residing in the cache. Cache performance can be improved by reducing the interference from non-reused data. Therefore, the lifetime of other blocks is increased and it can contribute to cache hit. We propose a Lifetime-aware LRU Promotion Policy and show that changing the promotion policy can effective reduce cache miss in the last-level cache. Our promotion policy dynamically adjusts promotion strategy and increases the lifetime for useful cache blocks. The experimental results show that our proposal reduces the average MPKI by 6% and 9% over EAF and DIP, respectively. In multicore, we also improve the performance and reduce the MPKI.

UR - http://www.scopus.com/inward/record.url?scp=84936966530&partnerID=8YFLogxK

U2 - 10.1109/VLSI-DAT.2015.7114579

DO - 10.1109/VLSI-DAT.2015.7114579

M3 - Conference contribution

AN - SCOPUS:84936966530

T3 - 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015

BT - 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015

Y2 - 27 April 2015 through 29 April 2015

ER -

Wu HY, Chen CC, Tsai HJ, Peng YC, Chen TF. Lifetime-aware LRU promotion policy for last-level cache. In 2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. 7114579. (2015 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2015). doi: 10.1109/VLSI-DAT.2015.7114579

Lifetime-aware LRU promotion policy for last-level cache

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this