The g-good-neighbour conditional diagnosability of multiprocessor system based on half hypercube

ABSTRACT

Fault diagnostic analysis is an important evaluation in the design and maintenance of multiprocessor systems. The g-good-neighbour conditional diagnosability is the maximum number of faulty vertices a multiprocessor system can guarantee to identify under the condition that every fault-free vertex has at least g fault-free neighbours. In this paper, we first establish the -connectivity of multiprocessor system based on half hypercube and then show that the g-good-neighbour conditional diagnosabilities of half hypercube under the PMC model and MM* model are for and . As a by-product, we also derive the g-good-neighbour conditional diagnosability of hierarchical cubic network since an n-dimensional half hypercube network is isomorphic to an n/2-dimensional hierarchical cubic network when n is even.

KEYWORDS:

• -connectivity
• g-good-neighbour conditional diagnosability
• half hypercube
• PMC model
• MM* model

MSC2010:

• 94C12
• 68M07
• 68M15
• 68R10
• 05C40

Disclosure statement

No potential conflict of interest was reported by the authors.

Additional information

Funding

This work was partly supported by the National Natural Science Foundation of China (Nos. 61572010, 61602118, 61702100, and 61702103), Natural Science Foundation of Fujian Province (Nos. 2017J01738, 2016J01289, and 2015J01240). China Postdoctoral Science Foundation (Nos. 2017M612107 and 2018T110636).