An interconnection network RPn(k) and its properties

Abstract

Petersen graph has good performance in parallel and distributed computation because of its properties such as short diameter and regularity. Based on the simple scalable properties of ring and the short network diameter of Petersen graph, a new interconnection network RPn(k) is proposed and the properties of the RPn(k) are analyzed. It is proved that RPn(k) not only has good regularity and extensibility, but also has shorter diameter and smaller construction costs than the RP(k) network. Additionally, The conditions satisfying that the network diameter of RPn(k) are better than those of 2D Torus are presented.