The G-Good-Neighbor Local Diagnosability of a Hypercube Network Under the PMC Model

Abstract

A significant indicator used in evaluating the reliability of a multiprocessor system is fault diagnosability. Researchers concentrate on the diagnosability of the entire system while ignoring important local information about the system. In our paper, an innovative concept of fault diagnosability, called g-good-neighbor local diagnosability, is put forward to study the diagnosability of a system at a node under the g-good-neighbor condition. Moreover, we obtain the relationship between the local diagnosability of a system at each node and the whole system's diagnosability under the g-good-neighbor condition. Under the PMC model, we prove that the g-good-neighbor local diagnosability of an n-dimensional hypercube network Qn at each node is at least 2g(n - g + 1) - 1 for 0 ≤ g ≤ n - 3 and that when n - 2 ≤ g ≤ n - 1, the g-good-neighbor local diagnosability of Qn at each node is 2n-1 - 1. Further, we easily derive the diagnosability of hypercube Qn under the g-good-neighbor condition.

Keywords

• Multiprocessor system
• g-good-neighbor local diagnosability%22%2C%22default_operator%22%3A%22AND%22%7D%7D%7D"> <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">g</italic>-good-neighbor local diagnosability
• PMC model
• hypercube network