Enhancing Lifetime of PCM-Based Main Memory with Efficient Recovery of Stuck-at Faults

Marjan Asadinia, C. Bobda
{"title":"Enhancing Lifetime of PCM-Based Main Memory with Efficient Recovery of Stuck-at Faults","authors":"Marjan Asadinia, C. Bobda","doi":"10.1109/ISVLSI.2018.00072","DOIUrl":null,"url":null,"abstract":"Among several nonvolatile memory (NVM) candidates, PCM is selected as an attractive replacement to DRAM and comes with both challenges and opportunities. It has beautiful characteristics like non-volatility, better scalability, and lower leakage power. However, limited write endurance is the main burden toward its adoption in practice. It means that after a certain number of writes, some memory cells permanently stuck at either '0' or '1'. To solve this problem and provide strong fault tolerant system, some recovery techniques with minimal storage overhead are required. In this work, we propose a recovery mechanism that relies on static partitioning of a data block into some small number of groups and spreading out faults across the groups uniformly. We then exploit inversion mechanism along with shifting mechanism to continue the use of the failed cell with stuck-at value. So, our proposed method can recover multi bit stuck at faults per partition. Compare to the existing mechanisms, our experimental results for multi-threaded workloads reveal considerable improvement in lifetime and the number of recoverable failures per data block","PeriodicalId":114330,"journal":{"name":"2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISVLSI.2018.00072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Among several nonvolatile memory (NVM) candidates, PCM is selected as an attractive replacement to DRAM and comes with both challenges and opportunities. It has beautiful characteristics like non-volatility, better scalability, and lower leakage power. However, limited write endurance is the main burden toward its adoption in practice. It means that after a certain number of writes, some memory cells permanently stuck at either '0' or '1'. To solve this problem and provide strong fault tolerant system, some recovery techniques with minimal storage overhead are required. In this work, we propose a recovery mechanism that relies on static partitioning of a data block into some small number of groups and spreading out faults across the groups uniformly. We then exploit inversion mechanism along with shifting mechanism to continue the use of the failed cell with stuck-at value. So, our proposed method can recover multi bit stuck at faults per partition. Compare to the existing mechanisms, our experimental results for multi-threaded workloads reveal considerable improvement in lifetime and the number of recoverable failures per data block
提高基于pcm的主存寿命,有效恢复卡故障
在几种非易失性存储器(NVM)候选中,PCM被选为DRAM的有吸引力的替代品,同时也带来了挑战和机遇。它具有不易挥发、可扩展性好、泄漏功率小等优点。然而,有限的写入持久性是其在实践中采用的主要负担。这意味着在一定数量的写入之后,一些内存单元永久地停留在“0”或“1”。为了解决这个问题并提供强大的容错系统,需要一些存储开销最小的恢复技术。在这项工作中,我们提出了一种恢复机制,该机制依赖于将数据块静态划分为少量组,并将故障均匀地分布在组中。然后,我们利用反转机制和移位机制来继续使用具有卡值的失效单元。因此,我们提出的方法可以在每个分区的故障上恢复多个比特。与现有机制相比,我们针对多线程工作负载的实验结果显示,在生命周期和每个数据块的可恢复故障数量方面有了相当大的改进
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信