摘要
片上网络(NoC)系统通常集成很多不同尺寸大小的IP模块,具有不规则的拓扑结构,传统的路由算法可能不再适用。针对NoC不规则拓扑结构的路由问题,提出INC路由算法。该算法采用2个很小的路由表,即FDT路由表和IFDT路由表。实验结果证明,INC路由算法在多数情况下能找到2个节点之间的最短路径,平均延时小,而且FDT和IFDT路由表只有固定的12项,大小不会随着片上网络规模的增大而增大。
Network-on-Chip(NoC) system often integrates many heterogeneous components which have different sizes. This NoC has an irregular topology. In the irregular mesh, traditional routing algorithm may not be usable any more. To solve the routing problem, this paper proposes a novel routing algorithm, called INC routing algorithm. 1NC routing is based on two small routing tables, FDT and IFDT. The simulation result shows that the routing scheme can find the shortest path between two nodes in most cases, which reduces the latency a lot. And the routing tables FDT and IFDT have a fixed size of 12 items. Their sizes do not increase when mesh grows.
出处
《计算机工程》
CAS
CSCD
2013年第10期279-282,286,共5页
Computer Engineering
关键词
片上网络
不规则拓扑结构
路由算法
路由表
路由节点
容错
Network-on-Chip(NoC)
irregular topology structure
routing algorithm
routing table
routing node
fault-tolerant