4.6 Article

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

Journal

Publisher

IEEE COMPUTER SOC
DOI: 10.1109/TDSC.2016.2562620

Keywords

Interconnection networks; PMC model; conditional diagnosability; (n,k)-star graphs; fault tolerance; multiprocessor systems

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available