Conditionally t-diagnosable and t-diagnosable are important in system level diagnosis. Therefore,it is valuable to identify whether the system is conditionally t-diagnosable or t-diagnosable and derive the correspondi...Conditionally t-diagnosable and t-diagnosable are important in system level diagnosis. Therefore,it is valuable to identify whether the system is conditionally t-diagnosable or t-diagnosable and derive the corresponding conditional diagnosability and diagnosability. In the paper,distinguishable measures of pairs of distinct faulty sets with a new perspective on establishing functions are focused.Applying distinguishable function and decision function,it is determined whether a system is conditionally t-diagnosable( or t-diagnosable) or not under the PMC( Preparata,Metze,and Chien)model directly. Based on the decision function,a novel conditional diagnosability algorithm under the PMC model is introduced which can calculate conditional diagnosability rapidly.展开更多
Compared with accurate diagnosis, the system’s selfdiagnosing capability can be greatly increased through the t/kdiagnosis strategy at most k vertexes to be mistakenly identified as faulty under the comparison model,...Compared with accurate diagnosis, the system’s selfdiagnosing capability can be greatly increased through the t/kdiagnosis strategy at most k vertexes to be mistakenly identified as faulty under the comparison model, where k is typically a small number. Based on the Preparata, Metze, and Chien(PMC)model, the n-dimensional hypercube network is proved to be t/kdiagnosable. In this paper, based on the Maeng and Malek(MM)*model, a novel t/k-fault diagnosis(1≤k≤4) algorithm of ndimensional hypercube, called t/k-MM*-DIAG, is proposed to isolate all faulty processors within the set of nodes, among which the number of fault-free nodes identified wrongly as faulty is at most k. The time complexity in our algorithm is only O(2~n n~2).展开更多
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.展开更多
An interconnection network＇s diagnosability is an important metric for measuring its self-diagnostic capability. Permanent fault and intermittent fault are two different fault models that exist in an interconnection ...An interconnection network＇s diagnosability is an important metric for measuring its self-diagnostic capability. Permanent fault and intermittent fault are two different fault models that exist in an interconnection network. In this paper, we focus on the problem pertaining to the diagnosability of interconnection networks in an intermittent fault situation. First, we study a class of interconnection networks called crisp three-cycle networks, in which the Chin-number （the number of common vertices each pair of vertices share） is no more than one. Necessary and sufficient conditions are derived for the diagnosability of crisp three-cycle networks under the PMC （Preparata, Metze, and Chien） model. A simple check can show that many well-known intereonnection networks are crisp three-cycle networks. Second, we prove that an intereonnection network S is a ti-fault diagnosable system without repair if and only if its minimum in-degree is greater than ti under the BGM （Barsi, Grandoni, and Masetrini） model. Finally, we extend the necessary and sufficient conditions to determine whether an interconnection network S is ti-fault diagnosable without repair under the MM （Maeng and Malek） model from the permanent fault situation to the intermittent fault situation.展开更多
基金Supported by the National Natural Science Foundation of China(No.61562046)Science and Technology Project of Jiangxi Provincial Education Department(No.GJJ150777,GJJ160742)
文摘Conditionally t-diagnosable and t-diagnosable are important in system level diagnosis. Therefore,it is valuable to identify whether the system is conditionally t-diagnosable or t-diagnosable and derive the corresponding conditional diagnosability and diagnosability. In the paper,distinguishable measures of pairs of distinct faulty sets with a new perspective on establishing functions are focused.Applying distinguishable function and decision function,it is determined whether a system is conditionally t-diagnosable( or t-diagnosable) or not under the PMC( Preparata,Metze,and Chien)model directly. Based on the decision function,a novel conditional diagnosability algorithm under the PMC model is introduced which can calculate conditional diagnosability rapidly.
基金supported by the National Natural Science Foundation of China(61363002)
文摘Compared with accurate diagnosis, the system’s selfdiagnosing capability can be greatly increased through the t/kdiagnosis strategy at most k vertexes to be mistakenly identified as faulty under the comparison model, where k is typically a small number. Based on the Preparata, Metze, and Chien(PMC)model, the n-dimensional hypercube network is proved to be t/kdiagnosable. In this paper, based on the Maeng and Malek(MM)*model, a novel t/k-fault diagnosis(1≤k≤4) algorithm of ndimensional hypercube, called t/k-MM*-DIAG, is proposed to isolate all faulty processors within the set of nodes, among which the number of fault-free nodes identified wrongly as faulty is at most k. The time complexity in our algorithm is only O(2~n n~2).
基金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.
文摘An interconnection network＇s diagnosability is an important metric for measuring its self-diagnostic capability. Permanent fault and intermittent fault are two different fault models that exist in an interconnection network. In this paper, we focus on the problem pertaining to the diagnosability of interconnection networks in an intermittent fault situation. First, we study a class of interconnection networks called crisp three-cycle networks, in which the Chin-number （the number of common vertices each pair of vertices share） is no more than one. Necessary and sufficient conditions are derived for the diagnosability of crisp three-cycle networks under the PMC （Preparata, Metze, and Chien） model. A simple check can show that many well-known intereonnection networks are crisp three-cycle networks. Second, we prove that an intereonnection network S is a ti-fault diagnosable system without repair if and only if its minimum in-degree is greater than ti under the BGM （Barsi, Grandoni, and Masetrini） model. Finally, we extend the necessary and sufficient conditions to determine whether an interconnection network S is ti-fault diagnosable without repair under the MM （Maeng and Malek） model from the permanent fault situation to the intermittent fault situation.
