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

Guey Yun Chang, Gen Huey Chen

研究成果: 雜誌貢獻期刊論文同行評審

36 引文 斯高帕斯(Scopus)

摘要

(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 > 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 Mobius cubes. It is shown that a matching composition network of n dimensions is (Ω(2*log n/n), n)-diagnosable.

原文???core.languages.en_GB???
頁(從 - 到)73-79
頁數7
期刊IEEE Transactions on Computers
56
發行號1
DOIs
出版狀態已出版 - 1 1月 2007

指紋

深入研究「(t, k)-Diagnosis for Matching Composition Networks Under the MM* Model」主題。共同形成了獨特的指紋。

引用此