Abstract

The significant increase in the number of processors of the multiprocessor system increases its vulnerability to component failures. Diagnosability is an important indicator in measuring the reliability of interconnection networks. The g-good-neighbor conditional faulty set is a faulty set that each fault-free vertex is adjacent to at least g fault-free vertices. The g-good-neighbor conditional diagnosability gives the maximum cardinality of g-good-neighbor conditional faulty set that the system is guaranteed to identify. This paper we establish the g-good-neighbor conditional diagnosability of the crossed cube CQn under the PMC and MM* model.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call