中文摘要：

在平衡性能、成本以及实现的基础上,给出了一种新的片上互连网络――广义Petersen图互连网络GP（2m,1）,是一种拓扑结构简单、节点度小、网络成本较低,并且具有对称性以及良好扩展性的平面互连网络。GP（2m,1）互连网络节点采用一种新的约翰逊编码方法,使得路由算法简单高效。在不同负载和不同节点数量情况下,对GP（2m,1）、Ring和2DMesh网络的平均通讯延迟和平均吞吐量进行了模拟分析,结果表明GP（2m,1）互连网络较好的平衡了网络性能和成本,是一种简单高效的片上互连网络。

英文摘要：

Focusing on decreasing node degrees, reducing links and reusing IP cores, a regular Network-on-Chip （NoC） architecture, named Generalized Petersen （GP（2m, 1）） graph interconnection network, was proposed. The topology of GP （2m, 1） is very simple, planar, symmetric and scalable in architecture, and it is 3-regular plane graph with 4m nodes. The nodes of GP （2m, 1） adopt Johnson coding scheme that can make the design of routing algorithm simple and efficient. In the several network size scenarios, the GP （2m, 1） was compared with Ring and 2D Mesh by simulating and analyzing. And it is based on uniform load and more realistic load. The results show that the GP （2m, 1） topology is a good trade-off between performance and cost. It is a better candidate for NoC topology, when there are not too many network nodes.