检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李娇[1,2] 晁月斌[1] 冉峰 蔡升[1] 郭润龙 季渊 LI Jiao;CHAO Yuebin;RAN Feng;CAI Sheng;GUO Runlong;JI Yuan(Microelectronic Research and Development Center,Shanghai University,Shanghai 200444,China;Key Laboratory of Advanced Display and System Applications,MOE,Shanghai University,Shanghai 200072,China)
机构地区:[1]上海大学微电子研究与开发中心,上海200444 [2]上海大学新型显示技术及应用集成教育部重点实验室,上海200072
出 处:《现代电子技术》2021年第7期147-152,共6页Modern Electronics Technique
基 金:国家自然科学基金资助项目(61674100);国家自然科学基金资助项目(61774101)。
摘 要:针对三维片上网络中路由算法路径单一、容错机制不完善导致的网络性能受限的问题,提出一种具有路径多样性的容错路由算法。该算法首先分析路由路径,制定出最短路径下的路由策略;然后结合路径多样性,设计路由选择模型;最后对链路故障进行分类,设计更加均衡的容错绕行规则。实验结果表明:该算法相较于对比算法,在无链路故障时,吞吐量提升了2%,传输延时降低了17.1%;在5%链路故障时,吞吐量提升了20.9%,传输延时降低了5.8%。随着链路故障率的增加,该算法仍具有优势。The path of the routing algorithm in three-dimensional network-on-chip(3D NoC)is single and its fault-tolerant mechanism is imperfect,which lead to limited network performance,so a fault tolerant routing algorithm based on path diversity is proposed.In the algorithm,the routing path is analyzed to formulate routing strategy under the condition of the shortest routing path.The routing model is designed in combination with path diversity.Finally,the link faults are classified to design more balanced fault-tolerant bypass rules.Experiment results show that,in comparison with the contrastive algorithms,the network throughput increases by 2%and network transmission delay decreases by 17.1%when the proposed algorithm is used under the condition of no link faults;the network throughput increases by 20.9%and network transmission delay decreases by 5.8%when the proposed algorithm is used under the condition of 5%of the link failures.With the increase of the link fault rate,the proposed algorithm still has advantages.
关 键 词:三维片上网络 路径多样性 容错路由算法 流量均衡 平均延时 吞吐量 实验分析
分 类 号:TN402-34[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.15.225.105