Torus连接Petersen图互连网络及路由算法

Topology and Routing Algorithms of Torus Connected Petersen Graph Interconnect Network

可扩展性和短直径是设计大规模并行计算机系统互连网络的两个重要因素。基于Petersen图的短直径和正规性和Torus拓扑结构的可扩展性,提出了一种新的互连网络拓扑结构,称为Torus连接Petersen图互连网络。该互连网络拓扑结构具有短直径、正规性、对称性和良好的扩展性。网络节点采用混合编码方法,使得路由算法设计简单。分别设计了基于混合编码的单播、广播路由算法。分析表明提出的互连网络具有较好的拓扑性质。

Two important issues in the design of interconnection networks for massively parallel computers are sealability and small diameter. A new interconnection network topology, called Torus Connected Petersen Graph（TCPH）, was proposed. The TCPG network combines the small diameter and of petersen graph and the scalability of torus topology. The TCPG network has better properties, such as small diameter, regular, symmetry and the scalability. The nodes of the TCPG network adopt the hybrid coding scheme, which can make routing algorithms simple and efficient. Both unicasting and broadcasting routing algorithms were designed for the TCPG network, and it is based on the hybrid coding scheme. A detailed analysis shows that the TCPG network is a better interconnection network in the properties of topology and the performance of communication.