Xiaofan Yang, Tinghuai Chen, Zehan Cao, Zhongshi He, H. Cao
{"title":"一种多处理机系统故障诊断的新方案","authors":"Xiaofan Yang, Tinghuai Chen, Zehan Cao, Zhongshi He, H. Cao","doi":"10.1109/ATS.1996.555173","DOIUrl":null,"url":null,"abstract":"The present paper is concerned with the system-level probabilistic diagnosis problem of multiprocessor systems. First, a new diagnosis algorithm, known as the K-Step-Voting (K-SV) algorithm, is presented. This algorithm generalizes the Majority-Voting (MV) algorithm due to Blough et al. (1992). Then K-SV algorithm is theoretically proved to be better than the MV algorithm. Finally, through computer simulations, the K-SV algorithm is shown to be much superior to the MV algorithm when run on hypercube systems.","PeriodicalId":215252,"journal":{"name":"Proceedings of the Fifth Asian Test Symposium (ATS'96)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new scheme for the fault diagnosis of multiprocessor systems\",\"authors\":\"Xiaofan Yang, Tinghuai Chen, Zehan Cao, Zhongshi He, H. Cao\",\"doi\":\"10.1109/ATS.1996.555173\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The present paper is concerned with the system-level probabilistic diagnosis problem of multiprocessor systems. First, a new diagnosis algorithm, known as the K-Step-Voting (K-SV) algorithm, is presented. This algorithm generalizes the Majority-Voting (MV) algorithm due to Blough et al. (1992). Then K-SV algorithm is theoretically proved to be better than the MV algorithm. Finally, through computer simulations, the K-SV algorithm is shown to be much superior to the MV algorithm when run on hypercube systems.\",\"PeriodicalId\":215252,\"journal\":{\"name\":\"Proceedings of the Fifth Asian Test Symposium (ATS'96)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Fifth Asian Test Symposium (ATS'96)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ATS.1996.555173\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Fifth Asian Test Symposium (ATS'96)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATS.1996.555173","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
摘要
本文研究了多处理机系统的系统级概率诊断问题。首先,提出了一种新的诊断算法——k步投票(K-SV)算法。该算法推广了Blough et al.(1992)提出的Majority-Voting (MV)算法。然后从理论上证明了K-SV算法优于MV算法。最后,通过计算机仿真,K-SV算法在超立方体系统上运行时明显优于MV算法。
A new scheme for the fault diagnosis of multiprocessor systems
The present paper is concerned with the system-level probabilistic diagnosis problem of multiprocessor systems. First, a new diagnosis algorithm, known as the K-Step-Voting (K-SV) algorithm, is presented. This algorithm generalizes the Majority-Voting (MV) algorithm due to Blough et al. (1992). Then K-SV algorithm is theoretically proved to be better than the MV algorithm. Finally, through computer simulations, the K-SV algorithm is shown to be much superior to the MV algorithm when run on hypercube systems.