The (t, k)-diagnosability of shuffle-cubes under PMC model

ABSTRACT System-level diagnosis aims to identify faulty processors in a multiprocessor system by analysing the test results among the processors. The -diagnosis requires to identify and repair at least k faulty processors in each iteration until that all t faulty processors are found where . It is one of the most important system-level diagnosis strategies. Meanwhile, shuffle-cube , a variant of hypercube for multiprocessor systems, has some good combinatorial properties and fault-tolerant properties. In this paper, we propose a -diagnosis algorithm for n-dimensional shuffle-cube , and then we show that is -diagnosable. Moreover, we prove that the proposed algorithm can identify at most faulty nodes under the condition that it can identify at least n faulty nodes in each iteration.