基于多保留STT-RAM的最后一级缓存中基于写频率的动态分配

Mayank Baranwal, Udbhav Chugh, Shivang Dalal, Sukarn Agarwal, H. Kapoor
{"title":"基于多保留STT-RAM的最后一级缓存中基于写频率的动态分配","authors":"Mayank Baranwal, Udbhav Chugh, Shivang Dalal, Sukarn Agarwal, H. Kapoor","doi":"10.1109/ISQED51717.2021.9424250","DOIUrl":null,"url":null,"abstract":"Spin-Transfer Torque RAM (STT-RAM) exhibits advantages like high density, non-volatility, and low leakage power consumption, making them a plausible successor to SRAM in caches. However, STT-RAM’s large write energy and latency constrain its potential for commercial usage in caches. Relaxing STTRAM’s retention time is one of the emerging and viable solutions to alleviate this roadblock, as this reduces the write time and energy. Reduction of retention time, however, leads to premature expiry of blocks requiring frequent refreshes or writebacks. These approaches cause unnecessary stalls and increase miss-rate.This paper proposes using a cache with partitions of different retention times. It further puts forth a block placement and reallocation policy to use these different partitions effectively. A block is said to be placed in an optimal partition if the block is either accessed or evicted before it expires. In particular, infrequently written blocks are allocated to higher retention time partitions, guaranteeing a reduction in block expiry/writebacks. During the execution, at regular intervals, blocks are migrated to appropriate retention time partitions depending on the application characteristics. Experimental evaluation shows significant improvement in performance and miss-rate compared to baseline allocation policies.","PeriodicalId":123018,"journal":{"name":"2021 22nd International Symposium on Quality Electronic Design (ISQED)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"DAMUS: Dynamic Allocation based on Write Frequency in MUlti-Retention STT-RAM based Last Level Caches\",\"authors\":\"Mayank Baranwal, Udbhav Chugh, Shivang Dalal, Sukarn Agarwal, H. Kapoor\",\"doi\":\"10.1109/ISQED51717.2021.9424250\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Spin-Transfer Torque RAM (STT-RAM) exhibits advantages like high density, non-volatility, and low leakage power consumption, making them a plausible successor to SRAM in caches. However, STT-RAM’s large write energy and latency constrain its potential for commercial usage in caches. Relaxing STTRAM’s retention time is one of the emerging and viable solutions to alleviate this roadblock, as this reduces the write time and energy. Reduction of retention time, however, leads to premature expiry of blocks requiring frequent refreshes or writebacks. These approaches cause unnecessary stalls and increase miss-rate.This paper proposes using a cache with partitions of different retention times. It further puts forth a block placement and reallocation policy to use these different partitions effectively. A block is said to be placed in an optimal partition if the block is either accessed or evicted before it expires. In particular, infrequently written blocks are allocated to higher retention time partitions, guaranteeing a reduction in block expiry/writebacks. During the execution, at regular intervals, blocks are migrated to appropriate retention time partitions depending on the application characteristics. Experimental evaluation shows significant improvement in performance and miss-rate compared to baseline allocation policies.\",\"PeriodicalId\":123018,\"journal\":{\"name\":\"2021 22nd International Symposium on Quality Electronic Design (ISQED)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 22nd International Symposium on Quality Electronic Design (ISQED)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISQED51717.2021.9424250\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 22nd International Symposium on Quality Electronic Design (ISQED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISQED51717.2021.9424250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

自旋转移扭矩RAM (STT-RAM)具有高密度、非易失性和低泄漏功耗等优点,使其成为高速缓存中SRAM的合理继任者。然而,STT-RAM的大写入能量和延迟限制了它在高速缓存中的商业应用潜力。放松stream的保留时间是缓解这一障碍的新兴可行解决方案之一,因为这减少了写入时间和精力。但是,减少保留时间会导致需要频繁刷新或回写的块过早过期。这些方法会造成不必要的失速,增加失速率。本文建议使用具有不同保留时间分区的缓存。进一步提出了块放置和重新分配策略,以有效地利用这些不同的分区。如果一个块在过期之前被访问或被驱逐,那么该块就被放置在最佳分区中。特别是,不经常写入的块被分配到更高的保留时间分区,保证了块过期/回写的减少。在执行过程中,根据应用程序的特征,将块定期迁移到适当的保留时间分区。实验评估表明,与基线分配策略相比,性能和失分率有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DAMUS: Dynamic Allocation based on Write Frequency in MUlti-Retention STT-RAM based Last Level Caches
Spin-Transfer Torque RAM (STT-RAM) exhibits advantages like high density, non-volatility, and low leakage power consumption, making them a plausible successor to SRAM in caches. However, STT-RAM’s large write energy and latency constrain its potential for commercial usage in caches. Relaxing STTRAM’s retention time is one of the emerging and viable solutions to alleviate this roadblock, as this reduces the write time and energy. Reduction of retention time, however, leads to premature expiry of blocks requiring frequent refreshes or writebacks. These approaches cause unnecessary stalls and increase miss-rate.This paper proposes using a cache with partitions of different retention times. It further puts forth a block placement and reallocation policy to use these different partitions effectively. A block is said to be placed in an optimal partition if the block is either accessed or evicted before it expires. In particular, infrequently written blocks are allocated to higher retention time partitions, guaranteeing a reduction in block expiry/writebacks. During the execution, at regular intervals, blocks are migrated to appropriate retention time partitions depending on the application characteristics. Experimental evaluation shows significant improvement in performance and miss-rate compared to baseline allocation policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信