Issue No. 01 - January (2007 vol. 56)

ISSN: 0018-9340

pp: 73-79

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2007.1

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 t faulty processors, where t\geq k. In this paper, a (t,k){\hbox{-}}\rm 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 (\Omega({\frac{2^{n}\ast\log n}{n}}),n){\hbox{-}}\rm diagnosable.

INDEX TERMS

Diagnosability, matching composition network, MM* model, multiprocessor system, precise diagnosis strategy, (t, k){\hbox{-}}\rm diagnosis.

CITATION

Gerard J. Chang, Guey-Yun Chang, Gen-Huey Chen, "(t, k) - Diagnosis for Matching Composition Networks under the MM* Model",

*IEEE Transactions on Computers*, vol. 56, no. , pp. 73-79, January 2007, doi:10.1109/TC.2007.1