当前位置: X-MOL 学术Int. J. Found. Comput. Sci. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
The r-Extra Diagnosability of Hyper Petersen Graphs
International Journal of Foundations of Computer Science ( IF 0.8 ) Pub Date : 2021-04-23 , DOI: 10.1142/s0129054121500234
Shiying Wang 1
Affiliation  

The diagnosability of a multiprocessor system or an interconnection network plays an important role in measuring the fault tolerance of the network. In 2016, Zhang et al. proposed a new measure for fault diagnosis of the system, namely, the r-extra diagnosability, which restrains that every fault-free component has at least (r + 1) fault-free nodes. As a famous topology structure of interconnection networks, the hyper Petersen graph HPn has many good properties. It is difficult to prove the r-extra diagnosability of an interconnection network. In this paper, we show that the r-extra diagnosability of HPn is 1 2r2 + (n 1 2)r + n for n 4 and 0 r n 3 in the PMC model and for n 7 and 0 r 1 2(n 2) in the MM model.

中文翻译:

超彼得森图的 r-Extra 可诊断性

多处理器系统或互连网络的可诊断性在衡量网络的容错性方面起着重要作用。2016年,张等。提出了一种新的系统故障诊断措施,即r-额外的可诊断性,它限制每个无故障组件至少具有(r + 1)无故障节点。作为互连网络的著名拓扑结构,超彼得森图Hn有很多好的特性。很难证明r-互连网络的额外诊断能力。在本文中,我们表明r- 额外的诊断能力Hn -1 2r2 + (n -1 2)r + n为了n 40 r n - 3在 PMC 模型中,对于n 70 r 1 2(n - 2)在MM*模型。
更新日期:2021-04-23
down
wechat
bug