A high performance interconnection network for multiprocessor systems (Q688186)

This paper presents a high performance interconnection network, \({\mathcal P}^ \Sigma_ 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\leq r\leq 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 \({\mathcal P}^ \Sigma_ r\)-network also possesses other properties such as high scalability, regular topology and efficient message routing.