Abstract
In the application of multiple-processor systems some processors or links in a system may not function properly, thus the fault diagnosis is one of the most important issues in the analysis and maintenance of those systems. For the practical fault diagnosis systems, the probability that all neighboring processors of a processor are faulty simultaneously is very small. Thus, the conditional diagnosability, which is a new metric for evaluating such systems, assumes that every fault set does not contain all neighbors of any processor in the system. In this paper, the authors show that the n-dimensional shuffle-cube has the conditional diagnosability of 4n − 15 for n ≡ 2 (mod4) and n ≥ 10.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
