Conditional Diagnosability of k-Ary n-Cubes under the PMC Model

Abstract

Processor fault diagnosis plays an important role in measuring the reliability of multiprocessor systems and the diagnosis of many well-known interconnection networks. The conditional diagnosability, which is more general than the classical diagnosability, is to measure the diagnosability of a multiprocessor system under the assumption that all of the neighbors of any node in the system cannot fail at the same time. This study shows that the conditional diagnosability for k -ary n -cubes under the PMC model is 8 n  − 7 for k  ≥ 4 and n  ≥ 4.