(t, k)-diagnosis for matching composition networks
(t, k)-diagnosis, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and replaced in each iteration provided there are at most t faulty processors, where t >= k. This paper proposes a (t, k)-diagnosis algorithm for matching composition networks, which include many well-known interconnection networks such as hypercubes, crossed cubes, twisted cubes, and Mobius cubes. It is shown that matching composition networks of n dimensions are (Omega(2(n)*log n/n),n)-diagnosable, where n > 5.
(t, k)-diagnosis matching composition network sequential diagnosis diagnosability multiprocessor system pmc model precise diagnosis strategy