期刊
DISCRETE APPLIED MATHEMATICS
卷 247, 期 -, 页码 367-379出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2018.03.079
关键词
Cayley graphs; Fault diagnosis; Conditional diagnosability; Complete-transposition graphs
资金
- National Natural Science Foundation of China [11301217, 61572010, 61602118, 61702100, 11571139]
- New Century Excellent Talents in Fujian Province University [JA14168, JAT170118]
- Natural Science Foundation of Fujian Province, China [2018J01419, 2015J01017, 2017J01738]
Diagnosability is an important parameter to measure the ability of diagnosing faulty processors of a multiprocessor system. Conditional diagnosability is a realistic improvement of classical diagnosability under the condition that every processor has at least one fault free neighboring processor. Complete-transposition graphs are proposed to be potential competitive network models of hypercubes as well as star graphs. In this paper, we show that the conditional diagnosability of the complete-transposition graph CTn under the MM* model is 3/2 n(n - 1) 6 for n >= 7, while the conditional diagnosability of CTn under the PMC model is 2n(n - 1) 9 for n >= 5. (C) 2018 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据