With the development of high-performance computing and the expansion of large-scale multiprocessor sys-tems,it is significant to study the reliability of systems.Probabilistic fault diagnosis is of practical value to ...With the development of high-performance computing and the expansion of large-scale multiprocessor sys-tems,it is significant to study the reliability of systems.Probabilistic fault diagnosis is of practical value to the reliabilityanalysis of multiprocessor systems.In this paper,we design a linear time diagnosis algorithm with the multiprocessor sys-tem whose threshold is set to 3,where the probability that any node is correctly diagnosed in the discrete state can be cal-culated.Furthermore,we give the probabilities that all nodes of a d-regular and d-connected graph can be correctly diag-nosed in the continuous state under the Weibull fault distribution and the Chi-square fault distribution.We prove thatthey approach to 1,which implies that our diagnosis algorithm can correctly diagnose almost all nodes of the graph.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos.62172291,62272333,and U1905211the Postgraduate Research and Practice Innovation Program of Jiangsu Province of China under Grant No.KYCX21_2961+1 种基金Jiangsu Province Department of Education Future Network Research Fund Project under Grant No.FNSRFP-2021YB-39the Priority Academic Program Development of Jiangsu Higher Education Institutions,and the Collaborative Innovation Center of Novel Software Technology and Industrialization.
文摘With the development of high-performance computing and the expansion of large-scale multiprocessor sys-tems,it is significant to study the reliability of systems.Probabilistic fault diagnosis is of practical value to the reliabilityanalysis of multiprocessor systems.In this paper,we design a linear time diagnosis algorithm with the multiprocessor sys-tem whose threshold is set to 3,where the probability that any node is correctly diagnosed in the discrete state can be cal-culated.Furthermore,we give the probabilities that all nodes of a d-regular and d-connected graph can be correctly diag-nosed in the continuous state under the Weibull fault distribution and the Chi-square fault distribution.We prove thatthey approach to 1,which implies that our diagnosis algorithm can correctly diagnose almost all nodes of the graph.
