期刊文献+

NMR及NVP系统中表决算法分析与研究 被引量:7

Research on voting algorithm in NMR and NVP system
下载PDF
导出
摘要 在N模冗余(NMR)及N版本编程技术(NVP)系统中,通过对冗余模块的输出执行表决可以屏蔽子系统或部件产生的错误,处理分布式计算系统中出现的Byzantine故障、同步多个计算进程以及维护数据复制品一致性等;表决算法还可以用做某些容忍入侵应用的触发策略,发现故障并触发故障部件的状态恢复。在经过对大量的表决算法分析与研究后,对其进行归类,并对每种类型中具有代表性的算法进行了描述,指出它们的应用领域,同时从复杂度及可靠性等方面对这些算法进行横向比较。 In N-modular redundant(NMR) and N-version programming(NVP) system, the fault of the subsystem (component), the Byzantine failures of the distributed computing systems, clock synchronization between computing processors and the consistency of the replicated data objects could be handled by voting on the output of the redundant modules (versions). Moreover, the voting algorithm could be used as the trigger of some intrusion tolerance applications to find the fault component and drive it return to the normal state. Having surveyed a large number of references, the voting algorithms were classified, the typical algorithms of each category were described, application areas were proposed and the comparison of algorithm behavior were also survey based on the complexity and reliability.
出处 《计算机应用研究》 CSCD 北大核心 2008年第11期3463-3467,共5页 Application Research of Computers
基金 国家自然科学基金资助项目(60503012) 国家"863"计划资助项目(2007AA01Z405)
关键词 容错 表决算法 N模冗余 N版本编程技术 三模冗余 fault-tolerant voting algorithm NMR NVP TMR
  • 相关文献

参考文献38

二级参考文献54

  • 1杨孟飞.空间容错计算机的基本问题和对策[J].航天控制,1994,12(2):35-39. 被引量:2
  • 2闵应骅.容错计算二十五年[J].计算机学报,1995,18(12):930-943. 被引量:16
  • 3de Boer R C. A Generic Architecture for Fusion-Based Intrusion Detection Systems[D]. [s. l.]:Erasmus University, Rotterdam School of Economics,2002.
  • 4Brown A, Patterson D. Toward availability benchmarks: A case study of software RAID systems. In:Proceedings of USENIX, San Diago, CA, 2000. http://www. cs. berkeley, edu/abrown/papers/usenix00/paper.html.
  • 5David Patterson. Recovery oriented computing. Presented at Princeton University, University of Illinois, and University of Michigan, November, 2002. http://roc. cs. berkeley. edu/talks/UIUC. ppt.
  • 6David Patterson et al. Recovery oriented computing (ROC):Motivation, definition, techniques, and case studies, http://roc. cs. berkeley.edu/papers/RO_TR02-1175. pdf.
  • 7Christian Cachin. Distributing trust on the Internet. In: Proceedings of the International Conference on Dependable Systems and Networks (DSN'01), 2001. 183-192.
  • 8Alvisi L, Malkhiy D, Piercez E, Reiterx M K, Wright R N.Dynamic byzantine quorum systems. In:Proceedings of the International Conference on Dependable Systems and Networks(DSN'00), New York, 2000. 283-293.
  • 9Anindo Banerjea. Simulation study of the capacity effects of dispersity routing for fault tolerant reahime channels. In: Proceedings of ACM SIGCOMM, Palo Alto, California, USA,1996. 194-205.
  • 10Paul Felldman F,Silvio Micah. Optimal algorithms for Byzantine agreement. In:Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, USA, 1988.148-161.

共引文献76

同被引文献54

引证文献7

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部