检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国家数字交换系统工程技术研究中心,郑州450002
出 处:《计算机应用》2014年第10期2761-2765,2776,共6页journal of Computer Applications
基 金:国家863计划项目(2009AA012201);河南省自然科学基金资助项目(122300413201)
摘 要:针对较大规模片上网络(NoC)远端节点和邻近节点之间的通信问题,提出一种基于区域划分的层次化簇状分层网(CHM)结构。在此基础上,针对中间节点拥塞严重导致网络性能降低的问题,提出一种基于源区域路径选择的自适应算法。该算法利用CHM结构区域特性将路由决策由源节点移至源区域,同时在原有底层和上层节点对的基础上增加自适应节点对,并增加该部分节点对路由选择性,从而缓解网络拥塞状况。仿真实验表明,与最短路径算法相比,在合成流量和局部化流量模式下,该算法下的CHM结构饱和注入率最多可分别提升约51%和31%,因此该算法可有效提升网络整体吞吐性能。To facilitate the communication between remote and adjacent nodes on the large-scale Networks-on-Chip (NoC), a hierarchical Cluster-like Hierarchical Mesh (CHM) topology based on region partition was proposed. Correspondingly, to avoid performance degradation due to the bad network congestion near the intermediate nodes, an adaptive source region path selection algorithm was elaborated. According to the region characteristic in CHM, the routing decision was determined in the source region instead of source node only, and the adaptive routing node pair was distinguished among bottom and upper node pairs, which enhanced the routing selection performance for those node pairs, so as to alleviate the bad network congestion. The experimental results show that, compared with the shortest path algorithm, the proposed algorithm can increase saturation injection by at most 51% and 31% respectively under synthetic and local traffic patterns, showing an effective improvement in network throughput.
关 键 词:片上网络 层次拓扑结构 路由节点对 源区域 性能分析
分 类 号:TP393.03[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229