【24h】

Comparison-Based Diagnosis on Incomplete Star Graphs

机译:基于比较的不完整星图诊断

获取原文
获取原文并翻译 | 示例

摘要

Diagnosis is a popular approach for the reliability of multiprocessor systems. In this paper, we study the system diagnosis on star graphs under the comparison model. Following the concept of node diag-nosability [2], the strongly node-diagnosable property [3] is discussed. We prove that an n-dimensional star has this property, and an incomplete n-dimensional star with at most n - 3 missing edges also keep this strong property, for n ≥ 4. At last, the diagnosability of an incomplete n-dimensional star system with arbitrarily missing links is proved as the minimum value among the remaining degree of every processor, provided that the cardinality of the set of missing links does not exceed n - 3.
机译:诊断是提高多处理器系统可靠性的一种流行方法。本文在比较模型下研究星图的系统诊断。遵循节点可诊断性[2]的概念,讨论了可强节点诊断的属性[3]。我们证明n维星具有此特性,不完整的n维星具有最多n-3个缺失边,对于n≥4,也保持了此强特性。最后,不完整n维星的可诊断性如果缺少链接的集合的基数不超过n-3,则证明具有任意丢失链接的系统是每个处理器剩余程度中的最小值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号