X-cube: a variation of cube-connected-cycles network with lower average routing steps

Abstract

A fundamental and important research area in parallel computing is the design of high-performance interconnection networks for connecting the processors in parallel computers. This paper presents a new interconnection network, the X-cube, a variant of the Cube-Connected-Cycles (CCC), which has the same degree, and same diameter in the worst case as the CCC of the same size and a decreased number of routing steps in the average case. Associated with this network is a construction algorithm which illustrates the way of building the network, and a routing algorithm that describes the method of passing messages in the network. The proposed network is validated and its performance is evaluated experimentally through implementation of the above algorithms. A number of comparisons are made between this network and three existing networks, mesh, Hypercube, and the CCC.<>