2014 IEEE 20th International Symposium on High Performance Computer Architecture (HPCA) 2014
DOI: 10.1109/hpca.2014.6835921
|View full text |Cite
|
Sign up to set email alerts
|

Locality-aware data replication in the Last-Level Cache

Abstract: Next generation multicores will process massive data with varying degree of locality. Harnessing on-chip data locality to optimize the utilization of cache and network resources is of fundamental importance. We propose a locality-aware selective data replication protocol for the last-level cache (LLC). Our goal is to lower memory access latency and energy by replicating only high locality cache lines in the LLC slice of the requesting core, while simultaneously keeping the off-chip miss rate low. Our approach … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
34
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(34 citation statements)
references
References 34 publications
(31 reference statements)
0
34
0
Order By: Relevance
“…We exploit heterogeneous interconnects and optimize caching strategy targeting on shared written blocks with high coherence overhead. Some works [11,15] exploit block placement and/or replication policy in LLC based on block access patterns, which optimize block placement on LLC. While our work carefully orchestrates caching strategy for different blocks in the memory hierarchy.…”
Section: Related Workmentioning
confidence: 99%
“…We exploit heterogeneous interconnects and optimize caching strategy targeting on shared written blocks with high coherence overhead. Some works [11,15] exploit block placement and/or replication policy in LLC based on block access patterns, which optimize block placement on LLC. While our work carefully orchestrates caching strategy for different blocks in the memory hierarchy.…”
Section: Related Workmentioning
confidence: 99%
“…omparative Analysis of L3 Cache Optimizing Techniques ome the issue, many researchers have proposed replication techniques. Kurian et al [39] have sive-Shared-Invalid) protocol, if one private cache L1 of core A holds data and another private cache of other core B requests for the same data, then it sends request on network [10]. If requested data in private cache of Core A are valid and the respective core is free to respond back, then Core B is given the requested data and data block is marked with Shared state; otherwise core B needs to wait.…”
Section: Data Replication On Last Level Cachementioning
confidence: 99%
“…Applications used multithreading on multicores to get faster operations. In order to improve performance and energy efficiency good scalability for multicore and assurance of single core performance is important [39].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…T HE increasing bandwidth demand of current memory-intensive applications incurs significant data movement that negatively impacts off-chip bandwidth, on-chip memory access latency, and energy consumption [1] [2] [3] [4]. To reduce data transfer between on-chip and off-chip memory components, commercial multi-core systems utilize multi-level cache methodology [5] [6] [7] whereby fast, low-capacity, and high leakage power SRAM arrays are employed in the upperlevels of cache, i.e.…”
Section: Introductionmentioning
confidence: 99%