Abstract

ABSTRACTSystem-level diagnosis aims to identify faulty processors in a multiprocessor system by analysing the test results among the processors. The -diagnosis requires to identify and repair at least k faulty processors in each iteration until that all t faulty processors are found where . It is one of the most important system-level diagnosis strategies. Meanwhile, shuffle-cube , a variant of hypercube for multiprocessor systems, has some good combinatorial properties and fault-tolerant properties. In this paper, we propose a -diagnosis algorithm for n-dimensional shuffle-cube , and then we show that is -diagnosable. Moreover, we prove that the proposed algorithm can identify at most faulty nodes under the condition that it can identify at least n faulty nodes in each iteration.

Full Text
Paper version not known

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 call

Disclaimer: 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.