Abstract
The hypercube architecture is a popular topology for many parallel processing applications. For continued operation of the hypercube multiprocessors after the failure of one or more i-subcubes and/or links, fault tolerance by reconfiguration is an important problem. This paper considers the reconfiguration issue and presents an algebraic technique to analyze the problem extending the concepts in [9]. The technique uses algebraic operators to identify the maximum dimensional fault-free subcube, and thus helps in achieving graceful degradation of the system. We analyze the complexity of our algorithm and show that it is efficient as compared to previous algorithms [1, 8, 14].
Sign-in/Register to access full text options 
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.
