检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张培雯 于宗光[1,2] 陈振娇 徐新宇 ZHANG Peiwen;YU Zongguang;CHEN Zhenjiao;XU Xinyu(School of Internet of Things Engineering,Jiangnan University,Wuxi Jiangsu 214122,China;The 58th Research Institute,China Electronics Technology Group Corp,Wuxi Jiangsu 214072,China)
机构地区:[1]江南大学物联网工程学院,江苏无锡214122 [2]中国电子科技集团公司第五十八研究所,江苏无锡214072
出 处:《电子器件》2022年第3期533-537,共5页Chinese Journal of Electron Devices
基 金:国家自然科学基金项目(6170461);江苏省重点研发项目(2018704161)。
摘 要:针对片上网络(Network on Chip,NoC)中由于通信量增大而出现的拥塞问题,提出了一种加权轮询仲裁策略。对在传输方向上剩余跳数较少且其端口负载量较大的报文请求赋予较高的权重值,权重值高的请求优先传输,其占用的网络资源得以尽快释放,减少网络中总的报文数目,缓解网络拥塞。同时,采用具有容错功能的自适应路由算法,构建了一套完整的算法执行方案。介绍了NoC路由器关键模块的设计,给出相应的仿真结果。实验结果表明,在网络通信量较大时,本文路由方案在平均包延时性能方面相较于采用普通轮询仲裁路由具有明显优势。Aiming at the congestion problem of the network on chip(NoC)due to the increase in communication volume,an weighted round robin arbitration strategy is proposed.A higher weight value is assigned to a packet request with a smaller number of remaining hops in the transmission direction and a larger port load.The requests are transmitted in priority,and the occupied network resources can be released as soon as possible,reducing the total network load,alleviating network congestion.At the same time,an adaptive routing algorithm with fault tolerance is adopted.The key modules of NoC routers are introduced,and the corresponding simulation results are given.The experimental results show that the proposed routing scheme has obvious advantages compared with the common round robin arbitration routing in terms of average packet delay when the network traffic is large.
分 类 号:TN47[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117