一种新型NoC互连算法及连线冗余的修正  

A New Algorithm for Connection in NoC and Redundancy Correction

作　　者：刘一[1,2] 段成华[1] 

机构地区：[1]中国科学院研究生院信息科学与工程学院,北京100049 [2]中国民航管理干部学院,北京100102

出　　处：《国防科技大学学报》2010年第3期65-68,共4页Journal of National University of Defense Technology

基　　金：国家863高技术资助项目

摘　　要：片上网络(Noc)是一种新兴的以包交换为通信方式的芯片互连结构。NoC的互连问题可以抽象为在有障碍曼哈顿平面生成最小森林的图论问题,本文提出了一种新型的NoC互连算法,该算法通过对连线边长权重进行更改后再调用最小生成树算法,并针对连线冗余进行修正。实验表明,该算法使得片上网络的全局连线长度最小,从而解决传统片上总线结构中连线延时长、信号完整性差等缺点。Network on Chip （NoC） adopts the packages exchanging interconnection framework for communications on chip. The interconnection problem of NoC can be abstracted as a minimal spanning forest problem in Manhattan plane. A new algorithm based on obstacle avoiding rectilinear Steiner minimal tree by changing the edge weights is proposed for the connection,an optimization method for interconnection redundancies removing is also proposed. Experiments show that the total connection length for NoC is minimized. So the traditional bus communication framework＇s disadvantages,such as long global connect delay,weak signal integrity may be eliminated.

关 键 词：STEINER树 片上网络 连线冗余 

分 类 号：TP331.1[自动化与计算机技术—计算机系统结构]