Zigzag-HVP: A Cost-effective Technique to Mitigate Soft Errors in Caches with Word-based Access

L. D. Hung, M. Goshima, S. Sakai
{"title":"Zigzag-HVP: A Cost-effective Technique to Mitigate Soft Errors in Caches with Word-based Access","authors":"L. D. Hung, M. Goshima, S. Sakai","doi":"10.2197/IPSJDC.2.748","DOIUrl":null,"url":null,"abstract":"Error Correction Code (ECC) is widely used to detect and correct soft errors in VLSI caches. Maintaining ECC on a per-word basis, which is preferable in caches with word-based access, is expensive. This paper proposes Zigzag-HVP, a cost-effective technique to detect and correct soft errors in such caches. Zigzag-HVP utilizes horizontal-vertical parity (HVP). HVP maintains the parity of a data array both horizontally and vertically. Basic HVP can detect and correct a single bit error (SBE), but not a multi-bit error (MBE). By dividing the data array into multiple HVP domains and interleaving bits of different domains, a spatial MBE can be converted to multiple SBEs, each of which can be detected and corrected by the corresponding parity domain. Vertical parity updates and error recovery in Zigzag-HVP can be efficiently executed through modifications to the cache data paths, write-buffer, and Built-In Self Test. The evaluation results indicate that the area and power overheads of Zigzag-HVP caches are lower than those of ECC-based ones.","PeriodicalId":432390,"journal":{"name":"Ipsj Digital Courier","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ipsj Digital Courier","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2197/IPSJDC.2.748","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Error Correction Code (ECC) is widely used to detect and correct soft errors in VLSI caches. Maintaining ECC on a per-word basis, which is preferable in caches with word-based access, is expensive. This paper proposes Zigzag-HVP, a cost-effective technique to detect and correct soft errors in such caches. Zigzag-HVP utilizes horizontal-vertical parity (HVP). HVP maintains the parity of a data array both horizontally and vertically. Basic HVP can detect and correct a single bit error (SBE), but not a multi-bit error (MBE). By dividing the data array into multiple HVP domains and interleaving bits of different domains, a spatial MBE can be converted to multiple SBEs, each of which can be detected and corrected by the corresponding parity domain. Vertical parity updates and error recovery in Zigzag-HVP can be efficiently executed through modifications to the cache data paths, write-buffer, and Built-In Self Test. The evaluation results indicate that the area and power overheads of Zigzag-HVP caches are lower than those of ECC-based ones.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Zigzag-HVP:一种降低基于字访问缓存软错误的高效技术
纠错码(Error Correction Code, ECC)被广泛用于超大规模集成电路(VLSI)缓存中的软错误检测和纠错。以每个单词为基础维护ECC(这在具有基于单词的访问的缓存中更可取)是昂贵的。本文提出了一种具有成本效益的Zigzag-HVP技术来检测和纠正此类缓存中的软错误。zzag -HVP利用水平-垂直奇偶校验(HVP)。HVP在水平和垂直两方面维护数据数组的奇偶性。基本HVP可以检测和纠正单比特错误(SBE),但不能检测和纠正多比特错误(MBE)。通过将数据阵列划分为多个HVP域,并将不同域的位相互交错,可以将一个空间MBE转换为多个sbe,每个sbe都可以通过相应的奇偶校验域进行检测和校正。通过修改缓存数据路径、写缓冲区和内置自检,可以有效地执行Zigzag-HVP中的垂直奇偶校验更新和错误恢复。评价结果表明,Zigzag-HVP高速缓存的面积和功耗都低于基于ecc的高速缓存。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Distributed-Processing System for Accelerating Biological Research Using Data-Staging A Type System for Dynamic Delimited Continuations A Combination Method of the Tanimoto Coefficient and Proximity Measure of Random Forest for Compound Activity Prediction Peer-to-Peer Multimedia Streaming with Guaranteed QoS for Future Real-time Applications A Benchmark Tool for Network I/O Management Architectures
×
引用
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