A reduced diameter interconnection network

A network based on the hypercube, called the multiply twisted cube is proposed. This network preserves many of the desirable properties of the hypercube, but has a diameter which is only [(n+1)/2] for an n-dimensional multiple twisted cube, a reduction of nearly 50% compared to the ordinary hypercube. Some of the basic topological properties of multiply twisted cubes are discussed, and a routing algorithm which produces optimal paths is presented. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, suggests that the multiply twisted cube is an attractive alternative to the ordinary hypercube for massively parallel architectures