Abstract
The authors develop graph-theoretical techniques using automorphisms to solve the problem of reconfiguring embedded task graphs in faulty hypercubes. Four cases are considered: single node or link failure, small number ( or=5) of random node failures. For single node (link) failure, any arbitrary task graphs embedded in a hypercube can be remapped to another instance of that graph by simple bit-flip operations. It takes at most O(n) such operations in an n-dimensional hypercube. For a small number of faults ( >
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.
