Abstract
This paper presents a system-level diagnosis algorithm for hypercube multicomputer systems based on the PMC model. The algorithm can isolate all faulty processors to a set with at most one fault-free processor. The breadth-first search (BFS) is applied in the new algorithm. Let N denote the total number of processors in a hypercube system. With the help of properties of hypercube tree defined in this paper and a new tree-decomposition technique, the algorithm runs in O( N) time if log 2 N ⩾ 10; whereas the best-known diagnosis algorithm runs in O( N log 2 N) time if log 2 N ⩾ 19.
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.
