Conditional Diagnosability of (n,k)-Star Graphs under the PMC Model

研究成果: Article同行評審

18 引文 斯高帕斯(Scopus)

摘要

Fault diagnosis has played a major role in measuring the reliability of multiprocessor systems. The diagnosability of many well-known multiprocessor systems has been widely investigated. Conditional diagnosability is a novel property of measuring diagnosability by adding a further condition that any fault set cannot contain all the neighbors of every node in the system. Several known structural properties of (n,k)-star graphs are exhibited. Based on these properties, we investigate the conditional diagnosability of (n,k)-star graphs under the PMC model, and show that it is 1) n/2 -1 for n≥ 4 and k=1, and 2) n+3k-6 for 2≤ k≤n-3.

原文English
頁(從 - 到)207-216
頁數10
期刊IEEE Transactions on Dependable and Secure Computing
15
發行號2
DOIs
出版狀態Published - 2018 三月 1

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程

指紋

深入研究「Conditional Diagnosability of (n,k)-Star Graphs under the PMC Model」主題。共同形成了獨特的指紋。

引用此