(t; k)-Diagnosis for matching composition networks
Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang · IEEE Transactions on Computers · 2006
(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 /spl ges/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 (/spl Omega/(2/sup n//spl middot/logn/n),n)-diagnosable, where n > 5.