The Mcube: a symmetrical cube based network with twisted links

The Mcube network proposed in this paper is a highly recursive and symmetrical interconnection network based on twisted links (Abraham and Padmanabhan, 1989). However, unlike other twist-based networks which are asymmetrical, the Mcube has a uniform distance distribution. In addition the Mcube is immune to the adverse effects of skewed traffic patterns that occur in asymmetrical structures. Mcubes have about half the diameter of a hypercube with the same node and link complexity. Mcubes have been defined in terms of the structure of components rather than relations between binary strings chiefly to ensure structural symmetry. Mcubes have a lower average internode distance than other twist-based networks. Reduced network congestion and low message delays allow Mcubes to perform significantly better than other comparable networks particularly under heavy traffic loads. Mcubes can emulate comparable hypercubes with a small routing overhead. Several classes of parallel algorithms can be mapped to execute faster on Mcubes than on hypercubes