EA-EO: Endurance Aware Erasure Code for SSD-Based Storage Systems

Saeideh Alinezhad Chamazcoti, S. Miremadi
{"title":"EA-EO: Endurance Aware Erasure Code for SSD-Based Storage Systems","authors":"Saeideh Alinezhad Chamazcoti, S. Miremadi","doi":"10.1109/PRDC.2014.18","DOIUrl":null,"url":null,"abstract":"One of the main issues in Solid State Drive (SSD)-based storage systems is endurance which is directly affected by the number of Program/Erase (P/E) cycles. The increment of P/E cycles increases the bit error rate threatening the reliability of SSDs. Erasure codes are used to leverage the reliability of storage systems but they also affect the number of P/E cycles based on their code pattern. A lower dependency between data and parities in the code pattern may lead to smaller number of P/E cycles providing better endurance. This paper introduces an Endurance Aware EVENODD (EA-EO), which minimizes the dependency between data and parities in the coding pattern. A simulation environment is used to compare the write-cycles of EA-EO with EVENODD in terms of different request size. The results show that the endurance improvement of EA-EO code could be as high as 44%. Furthermore, performance analysis of these codes in terms of parity construction and failure recovery shows that the number of XOR-operations is reduced in EA-EO compared to EVENODD.","PeriodicalId":187000,"journal":{"name":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 20th Pacific Rim International Symposium on Dependable Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2014.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

One of the main issues in Solid State Drive (SSD)-based storage systems is endurance which is directly affected by the number of Program/Erase (P/E) cycles. The increment of P/E cycles increases the bit error rate threatening the reliability of SSDs. Erasure codes are used to leverage the reliability of storage systems but they also affect the number of P/E cycles based on their code pattern. A lower dependency between data and parities in the code pattern may lead to smaller number of P/E cycles providing better endurance. This paper introduces an Endurance Aware EVENODD (EA-EO), which minimizes the dependency between data and parities in the coding pattern. A simulation environment is used to compare the write-cycles of EA-EO with EVENODD in terms of different request size. The results show that the endurance improvement of EA-EO code could be as high as 44%. Furthermore, performance analysis of these codes in terms of parity construction and failure recovery shows that the number of XOR-operations is reduced in EA-EO compared to EVENODD.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于ssd存储系统的持久性感知Erasure Code
基于固态硬盘(SSD)的存储系统的主要问题之一是持久性,它直接受到程序/擦除(P/E)循环次数的影响。P/E周期的增加会增加误码率,威胁到ssd硬盘的可靠性。Erasure code用于提高存储系统的可靠性,但也会根据其代码模式影响P/E周期的数量。代码模式中数据和对偶之间的依赖性较低,可能导致P/E循环次数较少,从而提供更好的持久性。本文介绍了一种可感知持久偶数(EA-EO)算法,该算法最大限度地减少了编码模式中数据和对偶之间的依赖关系。在不同的请求大小方面,使用仿真环境来比较EA-EO和EVENODD的写周期。结果表明,EA-EO码的耐久性能提高可达44%。此外,从奇偶构造和故障恢复方面对这些代码进行的性能分析表明,与EVENODD相比,EA-EO中的异或操作次数减少了。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Reduction of NBTI-Induced Degradation on Ring Oscillators in FPGA Region-Adherent Algorithms: Restricting the Impact of Faults on Service Quality CloudBFT: Elastic Byzantine Fault Tolerance Reliable Shortest Paths in Wireless Sensor Networks: Refocusing on Link Failure Scenarios from Applications Responsiveness of Service Discovery in Wireless Mesh Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1