Fault diagnosis technology is a method for locating faulty processors in multiprocessor systems, and it plays a crucial role in ensuring system stability, security and reliability. A widely used approach in this technology is the system-level strategy, which determines processor status by interpreting the set of test results between adjacent processors. Among them, thePMCandMMmodels are two commonly employed methods for generating these results. The diversity and complexity of network topologies in systems constrain existing algorithms to specific topologies, while the limitations of fault diagnosis strategies lead to reduced fault tolerance. In this paper, we present a novel path-based method to tackle the fault diagnosis problems in various networks according to the PMC and MM models. Firstly, we introduce the algorithm for partitioning the path into subpaths based on these models. To ensure that at least one subpath is diagnosed as fault-free, we derive the relationship between the fault bound$T$and the path length$N$. Then, building on methods for recognizing the subpath states, we have developed fault diagnosis algorithms for both the PMC and MM models. The simulation results show that our proposed algorithms can quickly and accurately diagnose faults in multiprocessor systems.

Abstract Fault diagnosis of processors plays a critical role in assessing the reliability of multiprocessor systems. The interconnection network’s diagnosability is an important metric for measuring its self-diagnostic capability which has been extensively studied in many novel mutiprocessor systems. Permanent fault diagnosability for many mutiprocessor systems has been determined; however intermittent fault diagnosability is hard to obtain due to its crypticity. In this paper, we focus on the problem pertaining to the diagnosability in the intermittent fault situation. First, by learning the characteristics of intermittent fault diagnosis in PMC model, we propose some theorems and lemmas for intermittent fault diagnosability. Secondly, we give the range of intermittent fault diagnosability of product network. Lastly, by adopting the theorems, we propose an Auto-IFD algorithm to find the intermittent faults of the hypercube network and conduct experiments to verify the theorems.

In the operation of large multiprocessor systems, intermittent faults have become an important reliability challenge due to their cryptic nature. In these systems, the occurrence of intermittent faults often affects the reliability of the system and disrupts the daily operation of the system. Existing studies have been able to determine the intermittent fault diagnosability of some crisp three-cycle networks, but there is still no effective method for determining the intermittent fault diagnosability and fault node confirmation of crossed cubes, twisted cubes and locally twisted cubes. Therefore, in this paper, we study the intermittent fault diagnosability of these three cubes. We propose theorems and lemmas to prove the intermittent fault diagnosability of n dimension cubes are di(CQn) = di(TQn) = di(LTQn) = n − 1, where n ≥ 3. Furthermore, we conduct experiments and implement a fault diagnosis algorithm to demonstrate our results.