A high performance interconnection network for multiprocessor systems

This paper presents a high performance interconnection network, P_r^∝-network, constructed by the recursive expansion (RE) method on the basis of the Petersen graph. The network contains 10^r+1 nodes and has degree 6, diameter 4r + 2 and cost 24r + 12 (product of the degree and diameter) for 0 ≤ r ≤ 10. The cost of the network is considerably lower than the torus and hypercube and is comparable with the CCC of the same size. The diameter is lower than the torus and CCC and is comparable with the hypercube. In addition to low cost, the P_r^∝-network also possess other properties such as high scalabiilty, regular topology and efficient message routing.