密码机制和容错系统中的协同一致  

Cipher mechanism and coordinate consistent of fault-tolerant system

作　　者：邹候文[1] 

机构地区：[1]广州大学理学院,广东广州510405

出　　处：《广州大学学报（自然科学版）》2003年第5期442-445,共4页Journal of Guangzhou University:Natural Science Edition

摘　　要：讨论了在不安全通信环境下有m个处理机出错的容错系统中的协同一致问题.通过密码机制和选举算法得出:只要有m+1个处理机正常工作即可实现协同一致,而在同样条件下文献[1]却需要2m+1个正常处理机.In this paper, it is discussed that fault_tolerant system in which m processors have error in unsafe communication environment can coordinate consistently. By cipher mechanism and election algorithms only m +1 processors can work well. But on the same conditions 2 m +1 processors needed in reference one.

关 键 词：协同一致 容错系统 密码机制 Fail-silent BYZANTINE 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]