Cache lifetime enhancement technique using hybrid cache-replacement-policy

被引:9
|
作者
Priya, Bhukya Krishna [1 ]
Kumar, Sampath [1 ]
Begum, B. Shameedha [1 ]
Ramasubramanian, N. [1 ]
机构
[1] Natl Inst Technol, Dept Comp Sci & Engn, Tiruchirappalli 620015, India
关键词
Non-volatile memory; Write variation; Magneto-resistive RAM; Magnetic tunnel junction; Least recently used;
D O I
10.1016/j.microrel.2019.03.011
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Driven by the trends of emerging technologies in memories, a non-volatile memory (NVM) has been considered as an alternate technology to replace SRAM in an on-chip cache. Spin-transfer torque random access memory (SIT-RAM), a new type of NVM technology has low leakage power and huge density of cells. Besides having advantages, the emerging NVM technologies have limited writes and huge error rates. The write endurance and error rates are influenced by the cache replacement algorithm, which ultimately dictates the lifetime of a cache. Hence, it becomes necessary to develop or modify the cache replacement algorithms for improving the lifetime of the SIT-RAM caches. The proposed Hybrid-Cache-Replacement (IICR) policy reduces the impact of the replacement algorithm in such a way that its write endurance improves with reduction in error rate. The incoming data are appropriately placed in the existing block, which have minimum error rates and less number of writes. It has been implemented by comparing the incoming bits with the existing bits in a cache set. The simulation results show that the lifespan of the SIT-RAM caches improves by 135%, 165% and 27% along with 2%, 2% and 1% performance overhead when compared to the existing methods.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 50 条
  • [31] A simple proof of optimality for the MIN cache replacement policy
    Lee, Mun-Kyu
    Michaud, Pierre
    Sim, Jeong Seop
    Nyang, DaeHun
    INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 168 - 170
  • [32] An effective LRU with random replacement policy for cache memory
    Khanfar, K
    PDPTA'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS 1-4, 2003, : 1837 - 1843
  • [33] An energy-efficient replacement policy for data cache
    Musalappa, S
    Sundaram, S
    Chu, Y
    PROCEEDINGS OF THE IEEE SOUTHEASTCON 2004: EXCELLENCE IN ENGINEERING, SCIENCE, AND TECHNOLOGY, 2005, : 599 - 602
  • [34] Measurement-based Modeling of the Cache Replacement Policy
    Abel, Andreas
    Reineke, Jan
    2013 IEEE 19TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS), 2013, : 65 - 74
  • [35] An effectiveness-based adaptive cache replacement policy
    Tian, Geng
    Liebelt, Michael
    MICROPROCESSORS AND MICROSYSTEMS, 2014, 38 (01) : 98 - 111
  • [36] FRIES-CAR: An adaptive cache replacement policy
    Pallis, G
    Vakali, A
    Sidiropoulos, E
    International Workshop on Challenges in Web Information Retrieval and Integration, Proceedings, 2005, : 74 - 79
  • [37] WRP: Weighting Replacement Policy to Improve Cache Performance
    Samiee, Kaveh
    Rad, GholamAli Rezai
    CSA 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND ITS APPLICATIONS, PROCEEDINGS, 2008, : 38 - 41
  • [38] Cache Replacement Policy Based on Expected Hit Count
    Vakil-Ghahani, Armin
    Mahdizadeh-Shahri, Sara
    Lotfi-Namin, Mohammad-Reza
    Bakhshalipour, Mohammad
    Lotfi-Kamran, Pejman
    Sarbazi-Azad, Hamid
    IEEE COMPUTER ARCHITECTURE LETTERS, 2018, 17 (01) : 64 - 67
  • [39] Predicting Performance Degradation on Adaptive Cache Replacement Policy
    Zhang, Yi
    Cui, Ran
    Lv, Mingsong
    Li, Chuanwen
    Deng, Qingxu
    2020 IEEE 26TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2020, : 109 - 116
  • [40] Behavior analysis of software controlled Cache replacement policy
    Du, Hongyan
    Pan, Yi
    Tian, Xingyan
    Ou, Xinliang
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2009, 37 (08): : 19 - 22