A Reuse-Degree Based Locality Classifier for Locality-Aware Data Replication

被引:0
|
作者
Wu, Qianqian [1 ]
Ji, Zhenzhou [1 ]
机构
[1] Harbin Inst Technol, Sch Comp Sci & Technol, Harbin 150001, Peoples R China
基金
中国国家自然科学基金;
关键词
Chip multiprocessors (CMPs); last level cache (LLC); data replication; locality classifier; reuse-degree (RD);
D O I
10.1109/ACCESS.2019.2959840
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The last level cache (LLC) in shared configuration is widely used in the tiled chip multiprocessors (CMPs), which reduces the off-chip miss rate but incurs the long on-chip access latency. The state-of-the-art Locality-Aware Data Replication (LADR) scheme provides an effective tradeoff between capacity and latency through an in-hardware structure named locality classifier. However, the best Limited(3) locality classifier (Limited(3)) in LADR equally preserves locality information of 3 cores for all cache lines indiscriminately that is superfluous for some lines reused by less than 3 cores but incomplete for other lines reused by more than 3 cores, which not only wastes the storage space but also limits the performance improvement. In this paper, we propose a novel concept of Reuse-Degree (RD) for each LLC line, since the line is loaded into LLC, to represent the number of cores that have reused the line. Then, we divide cache lines into Not Reused Line (NRL, RD = 0), Single Reused Line (SRL, RD = 1) and Multiple Reused Line (MRL, RD >= 2) based on their RDs and find that a significant fraction of LLC lines are NRLs or SRLs at any time. Based on this observation, we design a Reuse-Degree based Locality Classifier (RD_LC) for LADR. Specifically, RD_LC decouples the locality classifier from the LLC tag array and introduces two kinds of locality information arrays, single locality information array (SLIA) and complete locality information array (CLIA). Besides, RD_LC allocates a locality information entry only for the reused cache lines (SRLs or MRLs) instead of all cache lines, and assigns an SLIA entry to SRLs and a CLIA entry to MRLs. Our proposal avoids a waste of the storage space and also maintains enough locality information for the accuracy of data replication decisions. Experimental results show that our RD_LC for LADR saves 51% of the storage overhead than that of the baseline Limited(3) locality classifier with a performance improvement and a network traffic reduction by 7.56% and 3.33 % respectively.
引用
收藏
页码:182207 / 182216
页数:10
相关论文
共 50 条
  • [1] Locality-Aware Data Replication in the Last-Level Cache
    Kurian, George
    Devadas, Srinivas
    Khan, Omer
    [J]. 2014 20TH IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE (HPCA-20), 2014, : 1 - 12
  • [2] Availability of Data in Locality-Aware Unreliable Networks
    Geibig, Joanna
    [J]. MESH: 2009 SECOND INTERNATIONAL CONFERENCE ON ADVANCES IN MESH NETWORKS, 2009, : 163 - 166
  • [3] Locality-Aware Crowd Counting
    Zhou, Joey Tianyi
    Le Zhang
    Du Jiawei
    Xi Peng
    Fang, Zhiwen
    Zhe Xiao
    Zhu, Hongyuan
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2022, 44 (07) : 3602 - 3613
  • [4] A cluster file system for high data availability using locality-aware partial replication
    Kim, Jinseok
    Sim, Sangman
    Park, Sungyong
    [J]. 2007 CIT: 7TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY, PROCEEDINGS, 2007, : 345 - 350
  • [5] Locality-aware data replication in the last-level cache for large scale multicores
    Hijaz, Farrukh
    Shi, Qingchuan
    Kurian, George
    Devadas, Srinivas
    Khan, Omer
    [J]. JOURNAL OF SUPERCOMPUTING, 2016, 72 (02): : 718 - 752
  • [6] Locality-aware data replication in the last-level cache for large scale multicores
    Farrukh Hijaz
    Qingchuan Shi
    George Kurian
    Srinivas Devadas
    Omer Khan
    [J]. The Journal of Supercomputing, 2016, 72 : 718 - 752
  • [7] Taming Big Data SVM with Locality-Aware Scheduling
    Ye, Mao
    Wang, Jun
    Yin, Jiangling
    Han, Dezhi
    [J]. 2016 FOURTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD 2016), 2016, : 37 - 44
  • [8] Data-Driven Locality-Aware Batch Scheduling
    Gonthier, Maxime
    Larsson, Elisabeth
    Marchal, Loris
    Nettelblad, Carl
    Thibault, Samuel
    [J]. 2024 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, IPDPSW 2024, 2024, : 202 - 211
  • [9] Locality-Aware Mapping and Scheduling for Multicores
    Ding, Wei
    Zhang, Yuanrui
    Kandemir, Mahmut
    Srinivas, Jithendra
    Yedlapalli, Praveen
    [J]. PROCEEDINGS OF THE 2013 IEEE/ACM INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION (CGO), 2013, : 335 - 346
  • [10] Zeus: Locality-aware Distributed Transactions
    Katsarakis, Antonios
    Ma, Yijun
    Tan, Zhaowei
    Bainbridge, Andrew
    Balkwill, Matthew
    Dragojevic, Aleksandar
    Grot, Boris
    Radunovic, Bozidar
    Zhang, Yongguang
    [J]. PROCEEDINGS OF THE SIXTEENTH EUROPEAN CONFERENCE ON COMPUTER SYSTEMS (EUROSYS '21), 2021, : 145 - 161