Error Masking of Transient Faults: Exploration of a Fault Tolerant Datapath Based on User Specified Power and Delay Budget

A. Sengupta, Saumya Bhadauria
{"title":"Error Masking of Transient Faults: Exploration of a Fault Tolerant Datapath Based on User Specified Power and Delay Budget","authors":"A. Sengupta, Saumya Bhadauria","doi":"10.1109/ICIT.2014.15","DOIUrl":null,"url":null,"abstract":"This paper presents a novel exploration process of an optimal fault tolerant data path based on user specified power and delay budget during high level synthesis (HLS) that is capable of masking error occurred through single and multi cycle transient faults. The exploration framework is driven through bio-mimicking of E. Coli bacterium lifecycle. The major novelties of this approach are as follows: a) novel multi-cycle fault tolerant algorithm, b) novel design space exploration (DSE) approach that combines proposed fault tolerant algorithm along with user specified conflicting power-delay constraint that guides this intractable search problem to reach an optimal solution, c) novel double modular redundant (DMR) system with equivalent circuit scheme that performs the equivalent function of extracting the correct output as conventionally done using the concept of triple modular redundant (TMR) and voter. Results indicated an average improvement in quality of results (QoR) of >24% and reduction in hardware usage of > 57 % were obtained compared to a recent similar approach.","PeriodicalId":6486,"journal":{"name":"2014 17th International Conference on Computer and Information Technology (ICCIT)","volume":"60 1","pages":"345-350"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 17th International Conference on Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2014.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper presents a novel exploration process of an optimal fault tolerant data path based on user specified power and delay budget during high level synthesis (HLS) that is capable of masking error occurred through single and multi cycle transient faults. The exploration framework is driven through bio-mimicking of E. Coli bacterium lifecycle. The major novelties of this approach are as follows: a) novel multi-cycle fault tolerant algorithm, b) novel design space exploration (DSE) approach that combines proposed fault tolerant algorithm along with user specified conflicting power-delay constraint that guides this intractable search problem to reach an optimal solution, c) novel double modular redundant (DMR) system with equivalent circuit scheme that performs the equivalent function of extracting the correct output as conventionally done using the concept of triple modular redundant (TMR) and voter. Results indicated an average improvement in quality of results (QoR) of >24% and reduction in hardware usage of > 57 % were obtained compared to a recent similar approach.
暂态故障的错误屏蔽:基于用户指定功率和延迟预算的容错数据路径探索
本文提出了一种基于用户指定功率和延迟预算的高阶综合(HLS)最优容错数据路径的探索过程,该路径能够屏蔽单周期和多周期瞬态故障产生的错误。探索框架是通过对大肠杆菌生命周期的生物模拟来驱动的。这种方法的主要新颖之处如下:a)新颖的多周期容错算法;b)新颖的设计空间探索(DSE)方法,该方法将所提出的容错算法与用户指定的冲突功率延迟约束相结合,指导这一棘手的搜索问题达到最优解;c)具有等效电路方案的新型双模冗余(DMR)系统,该系统执行提取正确输出的等效功能,与传统使用三模冗余(TMR)和投票人的概念相同。结果表明,与最近的类似方法相比,结果质量(QoR)的平均改善>24%,硬件使用减少> 57%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信