Broadcasting on incomplete hypercubes
Jenn-Yang Tien, Ching-Tien Ho, et al.
SPDP 1991
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 can be added to the hypercube. We then investigate the idea of adding wildcard dimensions to (‘-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. © 1995 IEEE
Jenn-Yang Tien, Ching-Tien Ho, et al.
SPDP 1991
Ching-Tien Ho, Ming-Yang Kao
ICPP 1994
Ching-Tien Ho, Larry Stockmeyer
IEEE TC
Jehoshua Bruck, Robert Cypher, et al.
IEEE TC