The g-good-neighbour conditional diagnosability of enhanced hypercube under PMC model

Abstract

The significant increase in the number of processors of multiprocessor system increases its vulnerability to component failures. Diagnosability is an important indicator for the reliability of interconnection networks. The g-good-neighbour conditional diagnosability is the maximum number of faulty vertices a network can guarantee to identify, under the condition that every fault-free vertex has at least g fault-free neighbours (i.e. good neighbours). In this paper, we establish that the 1-good-neighbour conditional diagnosability of -enhanced hypercube network under PMC model is 2n−1 for n = k + 1 and , or 2n + 1 for n>k + 1 and , respectively. Moreover, the 2-good-neighbour conditional diagnosability of is 3n−3 for n = k + 1 and , or 4n−5 for n = k + 2 and , or 4n−1 for n>k + 2 and , respectively.