Mitigating the Cache Data Pollution by Using Branch Path Tracking

被引:0
|
作者
Liu Song-He [1 ]
Song Huan-Sheng [1 ]
Qi Shu-Min [1 ]
Zhang Jun
机构
[1] Chang An Univ, Dept Informat Engn, Xian 710064, Peoples R China
关键词
Branch Prediction; Speculative Accessing; Cache; Pollution;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
"Memory Wall" is one of the most important problems which must be solved for designing high performance processors. Efficient and intelligent cache system is key component of processor's memory system. We notice that cache pollution caused by the speculative execution of memory accessing instructions in predictive path may affect the cache and processor performance seriously. Based on the analyses of the impacts of speculative execution and cache data pollution to processor performance, this paper proposes a cache pollution control technique by using branch paths tracking, which is called Contra. Firstly, we construct a branch paths tracking table to follow the cache data written by memory accessing instructions in speculative branch paths. Then, processing of storage, accessing and replacement to these data are particularly controlled in order to mitigate influence of data pollution to cache system and processor performance. Simulation result indicates that, Contra technique eliminates cache pollution and upgrades performance effectively. Relative to the baseline architecture, D-Cache hit rate increases from 0.03% to 6.69%, average 1.80%. Improvement of IPC ranges from 0.01% to 6.60%, average 2.56%.
引用
收藏
页码:574 / 578
页数:5
相关论文
共 50 条
  • [21] Speed up Cassandra read path by using Coordinator Cache
    Vakili, Latifa Azizi
    Yazdani, Nasser
    2021 26TH INTERNATIONAL COMPUTER CONFERENCE, COMPUTER SOCIETY OF IRAN (CSICC), 2021,
  • [22] Mitigating DoS Attacks in SDN Using Offloading Path Strategies
    Huang, Tai-Siang
    Hsiung, Po-Yang
    Cheng, Bo-Chao
    JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (04): : 1281 - 1285
  • [23] Detection and Defense of Cache Pollution Based on Popularity Prediction in Named Data Networking
    Yao, Lin
    Zeng, Yujie
    Wang, Xin
    Chen, Ailun
    Wu, Guowei
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (06) : 2848 - 2860
  • [24] A Path and Branch Based Approach to Fitness Computation for Program Test Data Generation using Genetic Algorithm
    Pachauri, Ankur
    Gursaran
    Mishra, Gaurav
    2015 1ST INTERNATIONAL CONFERENCE ON FUTURISTIC TRENDS ON COMPUTATIONAL ANALYSIS AND KNOWLEDGE MANAGEMENT (ABLAZE), 2015, : 66 - 72
  • [25] Dynamic data dependence tracking and its application to branch prediction
    Chen, L
    Dropsho, S
    Albonesi, DH
    NINTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE, PROCEEDINGS, 2003, : 65 - 76
  • [26] Summary Cache of IoT Data Using ICN
    Sasaki, Hayate
    Kamiyama, Noriaki
    2021 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2021), 2021, : 707 - 710
  • [27] FLORA - A DATA PATH ALLOCATOR BASED ON BRANCH-AND-BOUND SEARCH
    LIU, TY
    LIN, YL
    INTEGRATION-THE VLSI JOURNAL, 1991, 11 (01) : 43 - 66
  • [28] A branch and bound algorithm for the robust shortest path problem with interval data
    Montemanni, R
    Gambardella, LM
    Donati, AV
    OPERATIONS RESEARCH LETTERS, 2004, 32 (03) : 225 - 232
  • [29] Path tracking mobile robot using steppers
    Deo, Ankit
    Gupta, Ayush
    Khemani, Himanshu
    Das, Rashmi Ranjan
    1ST INTERNATIONAL CONFERENCE ON SUSTAINABLE ENERGY AND FUTURE ELECTRIC TRANSPORTATION (SEFET 2019), 2019, 87
  • [30] Optimized Branch and Bound for Path-wise Test Data Generation
    Wang, Y. W.
    Xing, Y.
    Gong, Y. Z.
    Zhang, X. Z.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2014, 9 (04) : 497 - 509