Torus and mesh networks, k-ary n-cubes, pack N = k
nodes in a regular n-dimen-
sional grid with k nodes in each dimension and channels between nearest neighbors.
They span a range of networks from rings (n = 1) to binary n-cubes (k = 2), also
know as hypercubes.
These networks are attractive for several reasons. This regular physical arrange-
ment is well matched to packaging constraints.At low dimensions, tori have uniformly
short wires allowing high-speed operation without repeaters. Logically minimal paths
in tori are almost always physically minimal as well. This physical conservation
al lows torus and mesh networks to exploit ...