当前位置:
X-MOL 学术
›
IEEE Trans. Reliab.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
On Reliability of Multiprocessor System Based on Star Graph
IEEE Transactions on Reliability ( IF 5.0 ) Pub Date : 2020-06-01 , DOI: 10.1109/tr.2019.2919282 Mengjie Lv , Shuming Zhou , Gaolin Chen , Lanxiang Chen , Jiafei Liu , Chin-Chen Chang
IEEE Transactions on Reliability ( IF 5.0 ) Pub Date : 2020-06-01 , DOI: 10.1109/tr.2019.2919282 Mengjie Lv , Shuming Zhou , Gaolin Chen , Lanxiang Chen , Jiafei Liu , Chin-Chen Chang
As a critical parameter in evaluating the reliability of a multiprocessor system when processors malfunction, the \boldsymbol $h$ -extra connectivity ($h$ -EC) of a multiprocessor system modeled by a graph $G$ , denoted by $\kappa ^{(h)}_{o}(G)$ , is an $h$ -extra vertex-cut with minimum cardinality. Both of the $h$ -extra conditional diagnosability ($h$ -ECD) and the $t/h$ -diagnosability of the multiprocessor system are vital to tolerate and diagnose faulty processors. These two parameters rely on the resolving of $h$ -EC. For the multiprocessor system based on star graph $S_{n}$ , we show that the 5-EC $\kappa ^{(5)}_{o}(S_{n})$ of $S_{n}$ ($n\geq 5$ ) is $6n-18$ . As a by-product, we present a novel proof of $\kappa ^{(2)}_{o}(S_{n})=3n-7$ (resp., $\kappa ^{(4)}_{o}(S_{n})=5n-14$ ) by relaxing the restriction $n\geq 10$ (resp., $n\geq 7$ ) to $n\geq 5$ (resp., $n\geq 5$ ). Furthermore, we determine that the $h$ -ECD of $S_{n}$ $(n\geq 5)$ under the preparata, metze, and chien (PMC) model is $(h+1)n-2h-1$ for $1\leq h\leq 3$ and $(h+1)n-3h+2$ for $4\leq h\leq 5$ . In addition, we show that $S_{n}$ is $[(h+1)n-4h+2]/h$ -diagnosable for $4\leq h\leq 5$ , which extends the result that $S_{n}$ is $[(h+1)n-3h-1]/h$ -diagnosable for $1\leq h\leq 3$ by [Zhou et al. “The t/k-diagnosability of star graph networks,” IEEE Trans. Comput. , vol. 64, no. 2, pp. 547–555, Feb. 2015].
中文翻译:
基于星图的多处理器系统可靠性研究
当处理器发生故障时,作为评估多处理器系统可靠性的关键参数,\boldsymbol$h$ - 额外的连接($h$ -EC) 由图建模的多处理器系统 $G$ ,表示为 $\kappa ^{(h)}_{o}(G)$ , 是一个 $h$ - 具有最小基数的额外顶点切割。两者$h$ - 额外的条件诊断($h$ -ECD) 和 $t/h$ - 多处理器系统的可诊断性对于容忍和诊断故障处理器至关重要。这两个参数依赖于解析$h$ -EC。基于星图的多处理器系统$S_{n}$ ,我们表明 5-EC $\kappa ^{(5)}_{o}(S_{n})$ 的 $S_{n}$ ($n\geq 5$ ) 是 $6n-18$ . 作为副产品,我们提出了一个新的证明$\kappa ^{(2)}_{o}(S_{n})=3n-7$ (分别, $\kappa ^{(4)}_{o}(S_{n})=5n-14$ ) 通过放宽限制 $n\geq 10$ (分别, $n\geq 7$ ) 至 $n\geq 5$ (分别, $n\geq 5$ )。此外,我们确定$h$ -ECD的 $S_{n}$ $(n\geq 5)$ 在准备、梅策和 chien (PMC) 模型下 $(h+1)n-2h-1$ 为了 $1\leq h\leq 3$ 和 $(h+1)n-3h+2$ 为了 $4\leq h\leq 5$ . 此外,我们证明$S_{n}$ 是 $[(h+1)n-4h+2]/h$ - 可诊断 $4\leq h\leq 5$ ,这扩展了结果 $S_{n}$ 是 $[(h+1)n-3h-1]/h$ - 可诊断 $1\leq h\leq 3$ by [周 等。 “星图网络的 t/k 可诊断性,” IEEE 翻译 计算。 ,卷。64,没有。2,第 547-555 页,2015 年 2 月]。
更新日期:2020-06-01
中文翻译:
基于星图的多处理器系统可靠性研究
当处理器发生故障时,作为评估多处理器系统可靠性的关键参数,\boldsymbol