| 基于直角Steiner树的片上网络互连算法 |
| |
| 引用本文： | 刘一,段成华,易卫东.基于直角Steiner树的片上网络互连算法[J].微电子学,2009,39(2). |
| |
| 作者姓名： | 刘一 段成华 易卫东 |
| |
| 作者单位： | 中国科学院,研究生院,信息科学与工程学院,北京,100049 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 提出了一种基于最小直角Steiner树,在Manhattan平面上避免障碍物的互连算法,以实现片上网络中各IP核的互连.该算法在定制NoC中将Steiner树的生成算法用于互连设计.算法首先在初始阶段对有障碍两点间的边权重重新赋值,然后调用最小生成树算法,使生成的直角Steiner树总长度最小.实验表明,该算法可以使片上网络的总连线缩短.
|
| 关 键 词： | Steiner树 最小生成树 片上网络 片上系统 |
An Algorithm for Interconnection of NoC Based on Rectilinear Steiner Tree |
| |
| LIU Yi,DUAN Chenghua,YI Weidong.An Algorithm for Interconnection of NoC Based on Rectilinear Steiner Tree[J].Microelectronics,2009,39(2). |
| |
| Authors: | LIU Yi DUAN Chenghua YI Weidong |
| |
| Affiliation: | School of Information Science and Engineering;Graduate University of the Chinese Academy of Sciences;Beijing 100049;P.R.China |
| |
| Abstract: | A new algorithm based on obstacle avoiding rectilinear Steiner minimal tree in Manhattan plane was proposed for interconnections of IP cores in network on chip(NoC).In this algorithm,Steiner tree was used for connection design of the custom NoC.The length of connection was minimized by reevaluating weights of edges between points that had obstacles and generating minimal spanning tree.Experimental results showed that the algorithm can shorten the total length of interconnections of NoC. |
| |
| Keywords: | Steiner tree Minimal spanning tree NoC SoC |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
