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

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)207-216
Number of pages10
JournalIEEE Transactions on Dependable and Secure Computing
Volume15
Issue number2
DOIs
Publication statusPublished - 2018 Mar 1

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Conditional Diagnosability of (n,k)-Star Graphs under the PMC Model'. Together they form a unique fingerprint.

Cite this