最短路径自适应路由的路径条数及可缓冲的数据包数目  

Study on the Number of Paths and Number of Buffered Packets with Adaptive Shortest-path Routing

作　　者：胡东伟[1] 巴晓辉 雷岳俊[3] 王力男[1] HU Dongwei;BA Xiaohui;LEI Yuejun;WANG Linan(The Institute of CETC,Shijiazhuang 050080,China;School of Electronic and Information Engineering,Beijing Jiaotong University,Beijing 100044,China;School of information engineering,Minzu University of China,Beijing 100081,China)

机构地区：[1]中国电子科技集团公司第五十四研究所,石家庄050080 [2]北京交通大学电子信息工程学院,北京100044 [3]中央民族大学信息工程学院,北京100081

出　　处：《中央民族大学学报（自然科学版）》2023年第4期69-77,共9页Journal of Minzu University of China(Natural Sciences Edition)

摘　　要：在采用最短路径自适应路由方案的片上网络中,从源节点到目的节点具有多条可能的路径,采用最短路径有助于提高片上网络的效率。片上网络每一级路由器都能缓冲一定量的数据包,从源节点到目的节点的距离越远、路径数目越多,可缓冲的数据包数目越多。处理单元(Processing Element,PE)间数据传输需要的流量控制数据包越少,数据传输的效率越高。本文提出从源节点到目的节点可缓冲数据包数目的两种计算方法,并通过计算机搜索和仿真进行了验证。研究结果有助于提升对采用最短路径自适应路由的片上网络的行为的认识,从而设计更好的PE间数据传输方案。There are multiple paths from the source node to the destination node for Network-on-Chip(NoC) with adaptive shortest-path routing,which could improve the utilization efficiency of the NoC.At every hop of the NoC,a few packets could be buffered in the NoC router.Therefore,the far is the destination node away from the source node,and the more are there the paths from the source node to the destination node,the more packets could be buffered in the network,and the less traffic control packets are needed for packets transmission between Processing Elements(PEs).In this paper,2 methods are proposed for computing the number of paths from the source node to the destination node.In addition,the number of buffered packets is also theoretically obtained.Computer simulation and search are employed to verify the correctness of the proposed computations.The results could improve our understanding the behavior of NoC with adaptive shortest-path routing,and therefore is helpful for designing better data transmission schemes between PEs.

关 键 词：片上网络 最短路径路由 自适应路由 

分 类 号：TN919[电子电信—通信与信息系统]