A Path-Diversity Routing Algorithm with Adaptive Strategy for 3D Network-on-Chip

LI Jiao; CAI Sheng; GUO Run-long; RAN Feng

Chinese

您当前的位置：

首页 >

文章列表页 >

A Path-Diversity Routing Algorithm with Adaptive Strategy for 3D Network-on-Chip

更新时间：2026-09-04

- A Path-Diversity Routing Algorithm with Adaptive Strategy for 3D Network-on-Chip
- Vol. 36, Issue 2, Pages: 46-52(2019)
- 作者机构：
  
  1. 上海大学微电子研究与开发中心,上海,200072
  2. 上海大学新型显示技术及应用集成教育部重点实验室机构,上海,200072
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2019
- 稿件说明：
移动端阅览
李娇, 蔡升, 郭润龙, 冉峰. 一种具有路径多样性的自适应3DNoC路由算法[J]. 微电子学与计算机, 2019, 36(2): 46-52.

LI Jiao, CAI Sheng, GUO Run-long, et al. A Path-Diversity Routing Algorithm with Adaptive Strategy for 3D Network-on-Chip[J]. 2019, 36(2): 46-52.
李娇, 蔡升, 郭润龙, 冉峰. 一种具有路径多样性的自适应3DNoC路由算法[J]. 微电子学与计算机, 2019, 36(2): 46-52. DOI：

LI Jiao, CAI Sheng, GUO Run-long, et al. A Path-Diversity Routing Algorithm with Adaptive Strategy for 3D Network-on-Chip[J]. 2019, 36(2): 46-52. DOI：

摘要

针对当前三维片上网络(3DNoC)路由算法中路径单一且不能适应性调节负载而引起的网络性能受限的问题

本文提出一种具有路径多样性特征的自适应路由算法.首先

对现有的路由算法进行分析

总结出最优路由路径范围并对路由策略进行建模

使得数据包能够以最短路径路由到目的IP.随后

对三维片上网络路由器的负载进行分析

得到不同位置路由器负载的规律.最后根据路由器负载态势对路由策略模型进行优化

使网络在路径多样化条件下降低网络拥塞.实验结果表明

在各种网络负载情况下时

该算法大幅提高吐量

并能降低数据包延时.随着网络负载的提高

该算法依然具有优势.

Abstract

The previous routing algorithm in three-dimensional network-on-chip(3D NoC) without load adjust adaptability and path diversity will degrades performance. Aiming at this problem

this paper propose a path-diversity routing algorithm with load adjust strategy. Firstly

analysing existed routing algorithm

summarize the range of optimal path and build the model of routing strategy

for data packets can be routed to the destination IP with the shortest path; Then

analysis the load of three-dimensional network-on-chip and find the law of router load in different positions. Finally

according to the router load situation

the routing strategy model is optimized to reduce the network congestion under diversified path conditions. Experimental results show that the proposed algorithm has higher throughput rate and lower latency in average than other algorithm when the network load is low. with the increasesment of load

the present algorithm still has advantages.

关键词

Keywords

references

Chen K C, Kuo C C, Hung H S, et al. Traffic-and thermal-aware adaptive beltway routing for three dimensional network-on-chip systems[C].Circuits and Systems (ISCAS), 2013 IEEE International Symposium on. IEEE, 2013: 1660-1663.

Tsai W C, Chu K C, Hu Y H, et al. Non-minimal, turn-model based NoC routing[J]. Microprocessors and Microsystems, 2013, 37(8): 899-914. DOI: 899

Chiu G M. The odd-even turn model for adaptive routing[J]. IEEE Transactions on parallel and distributed systems, 2000, 11(7): 729-738. DOI: 729

Sun G, Chang C W, Lin B, et al. An oblivious routing algorithm for 3D mesh networks to achieve a new worst-case throughput bound[J]. IEEE Embedded Systems Letters, 2012, 4(4): 98-101. DOI: 98

Routing algorithms in networks-on-chip[M]. New York: Springer, 2014.

Chen Y Y, Chang E J, Hsin H K, et al. Path-Diversity-Aware Fault-Tolerant Routing Algorithm for Network-on-Chip Systems[J]. IEEE Transactions on Parallel and Distributed Systems, 2017, 28(3): 838-849. DOI: 838

Ramanujam R S, Lin B. Randomized partially-minimal routing on three-dimensional mesh networks[J]. IEEE Computer Architecture Letters, 2008, 7(2): 37-40. DOI: 37

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A high-efficiency charge pump for ultra-low voltage boost systems

Monte carlo analysis of V-layout trench SiC neutron detector

Microservices anomaly detection based on the correlation of monitoring metrics

A feature-oriented context understanding and slice analysis network for tuberculosis detection

Lightweight countermeasures against Spectre attacks on the branch prediction unit

Related Author

No data

Related Institution

No data

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰