Generalized supercube: an incrementally expandable interconnection network

Abstract

A class of incrementally expandable interconnection networks with high connectivity and low diameter is introduced for massively parallel and distributed processing. This class of networks can be constructed for any number of computing nodes, and the network size can easily be incremented without a major reconfiguration of the network. The connectivity and the diameter of the network are on the order of the logarithm of the number of nodes. It is shown that the connectivity of the network is equal to the minimum node degree. In this sense the connectivity is optimal. The routing algorithms for the network ar simple to implement.<>