| 引用本文: | 刘一,段成华.一种新型NoC互连算法及连线冗余的修正.[J].国防科技大学学报,2010,32(3):65-68.[点击复制] |
| LIU Yi,DUAN Chenghua.A New Algorithm for Connection in NoC and Redundancy Correction[J].Journal of National University of Defense Technology,2010,32(3):65-68[点击复制] |
|
| |
|
|
| 本文已被：浏览 6480次 下载 5904次 |
| 一种新型NoC互连算法及连线冗余的修正 |
| 刘一1,2, 段成华1 |
|
(1.中国科学院研究生院 信息科学与工程学院，北京 100049;2.中国民航管理干部学院，北京 100102)
|
| 摘要: |
| 片上网络(Noc)是一种新兴的以包交换为通信方式的芯片互连结构。NoC的互连问题可以抽象为在有障碍曼哈顿平面生成最小森林的图论问题，本文提出了一种新型的NoC互连算法，该算法通过对连线边长权重进行更改后再调用最小生成树算法，并针对连线冗余进行修正。实验表明，该算法使得片上网络的全局连线长度最小，从而解决传统片上总线结构中连线延时长、信号完整性差等缺点。 |
| 关键词: Steiner树 片上网络 连线冗余 |
| DOI： |
| 投稿日期：2009-09-01 |
| 基金项目:国家863高技术资助项目 |
|
| A New Algorithm for Connection in NoC and Redundancy Correction |
| LIU Yi1,2, DUAN Chenghua1 |
|
(1.School of Information Science and Engineering, Graduate Univ. of Chinese Academy of Sciences, Beijing 100049, China;2. 2.Civil Aviation Management Institute of China, Beijing 100102, China)
|
| Abstract: |
| 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. |
| Keywords: steiner tree Network on Chip (NoC) connection redundancy |
|
|
|
|
|
