20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment (HPCS'06) Designing and Reconfiguring Fault-Tolerant Hypercubes St. John's, Newfoundland May 14-May 17 ISBN: 0-7695-2582-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HPCS.2006.19
Several interconnection networks (such as meshes and hypercubes) can be modeled as circulant graphs. As a result, methods previously developed for constructing fault-tolerant solutions of circulant graphs can also be applied to these networks. Among these methods, the one based on the idea of "offsets partitioning" is the most efficient (for circulant graphs). We review this method in this paper, and extend its applications to hypercubes. Moreover, we develop new algorithms to reconfigure circulant graphs and hypercubes. Our results show that the fault-tolerant solutions obtained, and the reconfiguration algorithms developed are efficient.
Citation:
Abdel Aziz Farrag, Shituo Lou, "Designing and Reconfiguring Fault-Tolerant Hypercubes," hpcs, pp.11, 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment (HPCS'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||