PROJECT TITLE :

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

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 could be a novel property of measuring diagnosability by adding a further condition that any fault set cannot contain all the neighbors of each node within the system. Several known structural properties of (n, k)-star graphs are exhibited. Based on these properties, we tend to investigate the conditional diagnosability of (n, k)-star graphs below the PMC model, and show that it's one) ?two/n? -one for n = four and k = 1, and a couple of) n + 3k - half dozen for two = k = n-three.