부산대학교 도서관

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 d i (CQ n ) = d i (TQ n ) = d i (LTQ n ) = n − 1, where n ≥ 3. Furthermore, we conduct experiments and implement a fault diagnosis algorithm to demonstrate our results.