(t, k)-Diagnosis for Matching Composition Networks under the MM* Model.

Abstract-(t, k)-diagnosis, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and repaired in each iteration provided there are at most faulty processors, where t ≥ k. In this paper, a (t, k)-diagnosis algorithm under the MM* model is proposed for matching composition networks, which include many well-known interconnection networks, such as hypercubes, crossed cubes, twisted cubes, and Möbius cubes. It is shown that a matching composition network of n dimensions is (Ω(2ⁿ*log n / n), n)-diagnosable. [ABSTRACT FROM AUTHOR]