History-based weighted average voter: a novel software voting algorithm for fault-tolerant computer systems

G. L. Shabgahi, J. Bass, S. Bennett
{"title":"History-based weighted average voter: a novel software voting algorithm for fault-tolerant computer systems","authors":"G. L. Shabgahi, J. Bass, S. Bennett","doi":"10.1109/EMPDP.2001.905068","DOIUrl":null,"url":null,"abstract":"Voting algorithms have been widely used in the realisation of fault-tolerant systems. We propose a new software voting algorithm which uses the history record of redundant modules to compute the final output. Two versions for the novel algorithm are introduced In the first version any module result is assigned to a weighting value such that module results with higher history record value, are assigned to a higher weighing value than those with lower history record value. In the second version of the novel voter, those module results which have a history record value, less than the average record value, are allocated a weight of zero and removed from the contribution toward the voter output. Furthermore, a novel method for creation of a history record of modules is proposed. Empirical results show that both versions of the novel voter give higher safety performance than the Standard Weighted Average voter with permanent and transient errors.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2001.905068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 48

Abstract

Voting algorithms have been widely used in the realisation of fault-tolerant systems. We propose a new software voting algorithm which uses the history record of redundant modules to compute the final output. Two versions for the novel algorithm are introduced In the first version any module result is assigned to a weighting value such that module results with higher history record value, are assigned to a higher weighing value than those with lower history record value. In the second version of the novel voter, those module results which have a history record value, less than the average record value, are allocated a weight of zero and removed from the contribution toward the voter output. Furthermore, a novel method for creation of a history record of modules is proposed. Empirical results show that both versions of the novel voter give higher safety performance than the Standard Weighted Average voter with permanent and transient errors.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于历史的加权平均投票人:一种新的容错计算机系统软件投票算法
投票算法在容错系统的实现中有着广泛的应用。提出了一种利用冗余模块历史记录计算最终输出的软件投票算法。介绍了新算法的两个版本,在第一个版本中,任何模块结果都被赋予一个权重值,使得历史记录值较高的模块结果被赋予比历史记录值较低的模块结果更高的权重值。在新投票人的第二个版本中,那些历史记录值小于平均记录值的模块结果被分配为零权重,并从对投票人输出的贡献中删除。此外,还提出了一种创建模块历史记录的新方法。实证结果表明,两种版本的新投票人都比具有永久和瞬态误差的标准加权平均投票人具有更高的安全性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Adding flexibility and real-time performance by adapting a single processor industrial application to a multiprocessor platform Heterogeneous matrix-matrix multiplication or partitioning a square into rectangles: NP-completeness and approximation algorithms Parallel simulated annealing for the delivery problem Implementing on-line techniques to allocate file resources in large distributed systems Visual data-parallel programming for signal processing applications
×
引用
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