Petersen-Torus Networks for Multicomputer Systems

Abstract

In this paper, we propose and analyze a new interconnection network, called Petersen-torus (PT) network based on well-known Petersen graph. Petersen graph is the graph with the most desirable network cost to the number of nodes, such that it has the most number of nodes as 10 among graphs having degree 3 and diameter 2. Taking advantage of Petersen graph, PT was designed in place of Petersen graph having 10 nodes per node of torus. PT network has a smaller diameter and a smaller network cost than honeycomb torus with same nodes. We propose routing algorithm and we derive diameter, network cost and bisection width.