Bisectional Fault-Tolerant Communication Architecture for Supercomputer Systems
IEEE Transactions on Computers
An Observation on the Bisectional Interconnection Networks
IEEE Transactions on Computers
Cayley Graphs With Optimal Fault Tolerance
IEEE Transactions on Computers
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Multiple-Edge-Fault Tolerance with Respect to Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Fault-Tolerant Meshes with Small Degree
IEEE Transactions on Computers
Optimal 1-edge fault-tolerant designs for ladders
Information Processing Letters
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Pancyclicity on Möbius cubes with maximal edge faults
Parallel Computing
| Hi-index | 14.99 |
Hypercubes, meshes and tori are well known interconnection networks for parallel computers. The sets of edges in those graphs can be partitioned to dimensions. It is well known that the hypercube can be extended by adding a wildcard dimension resulting in a folded hypercube that has better fault-tolerant and communication capabilities. First we prove that the folded hypercube is optimal in the sense that only a single wildcard dimension ran be added to the hypercube. We then investigate the idea of adding wildcard dimensions to d-dimensional meshes and tori. Using techniques from error correcting codes we construct d-dimensional meshes and tori with wildcard dimensions. Finally, we show how these constructions can be used to tolerate edge and node faults in mesh and torus networks