Subscribe
Issue No.01 - January (1995 vol.44)
pp: 150-155
ABSTRACT
<p><it>Abstract—</it>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 <it>wildcard</it> dimension resulting in a <it>folded</it> 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 $<tmath>d</tmath>$-dimensional meshes and tori. Using techniques from error correcting codes we construct $<tmath>d</tmath>$-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.</p>
CITATION
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho, "Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes", IEEE Transactions on Computers, vol.44, no. 1, pp. 150-155, January 1995, doi:10.1109/12.367998
26 ms
(Ver 2.0)

Marketing Automation Platform