An Oblivious Routing Algorithm Based on 3D-Mesh Network

WANG Zhen-jiang; DUAN Xin-ming

Chinese

您当前的位置：

首页 >

文章列表页 >

An Oblivious Routing Algorithm Based on 3D-Mesh Network

更新时间：2026-09-04

- An Oblivious Routing Algorithm Based on 3D-Mesh Network
- Vol. 35, Issue 3, Pages: 23-27(2018)
- 作者机构：
  
  天津工业大学机构计算机科学与软件学院,天津,300387
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2018
- 稿件说明：
移动端阅览
王振江, 段新明. 基于3D-Mesh网络的一种Oblivious路由算法[J]. 微电子学与计算机, 2018, 35(3): 23-27.

WANG Zhen-jiang, DUAN Xin-ming. An Oblivious Routing Algorithm Based on 3D-Mesh Network[J]. 2018, 35(3): 23-27.
王振江, 段新明. 基于3D-Mesh网络的一种Oblivious路由算法[J]. 微电子学与计算机, 2018, 35(3): 23-27. DOI：

WANG Zhen-jiang, DUAN Xin-ming. An Oblivious Routing Algorithm Based on 3D-Mesh Network[J]. 2018, 35(3): 23-27. DOI：

摘要

3D-Mesh就是三维片上网络中一种常见拓扑结构.本文针对3D-Mesh网络提出了一种新的高吞吐率的随机Oblivious路由算法(Double Plane Turn

DPT).DPT算法通过降维

将3D-mesh网络转化为两个互相垂直2D-mesh

然后在2D-mesh网络下使用01Turn路由算法.由于01Turn路由算法具有良好的平均情况下的网络吞吐率和不错的延时

通过仿真实验证明

和以往的路由算法在平均情况下的网络吞吐率相比

本算法都实现了较好的结果.

Abstract

3D-Mesh is a common topology in a three-dimensional on-chip network. In this paper

a new high-throughput random Oblivious routing algorithm (Double Plane Turn

DPT) is proposed for 3D-Mesh network. The DPT algorithm transforms the 3D-mesh network into two mutually perpendicular 2D-meshes by reducing the dimension

and then uses the O1Turn routing algorithm on the 2D-mesh network. As the O1Turn routing algorithm has a good average network throughput and good delay

simulation experiments show that compared with the previous routing algorithm in the average case of network throughput

the algorithm has achieved good results.

关键词

Keywords

references

Ramanujamand R S, Lin B. Randomized partially-minimal routing: near-optimal oblivious routing for 3D mesh networks[J]. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2012, 20(11): 2080-2093. DOI: 2080

Seo D, Ali A, Lim W T, et al. Near-optimal worst-case throughput routing for two-dimensional mesh networks[J]. International Symposium on Computer Architecture, 2005, 33(2) : 432-443. DOI: 432

Guang Sun, Chia-Wei Chang, Bill Lin. 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

Sullivan H, Bashkow T R. A large scale, homogeneous, fully distributed parallel machine[C]// Proceedings of the 4th annual symposium on Computer architecture. Munchen, Germany, ACM Press, 1977: 105-117.

Valiant L G, Brebner G J. Universal schemes for parallel communication[C]//Proceedings of the thirteenth annual ACMsymposium on Theory of computing. New York, NY, USA, ACM Press, 1981: 263-277.

刘有耀. 片上网络拓扑结构与通信方法研究[D]. 西安: 西安电子科技大学, 2009.

刘招山. 片上网络若干关键技术的研究[D]. 厦门: 厦门大学, 2014.

Nesson T, Johnsson S L. Romm routing on mesh and torus networks[C]//Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures. Santa Barbara, California, ACM Press, 1995: 275-287.

李晨, 马胜, 王璐, 等. 三维片上网络体系结构研究综述[J]. 计算机学报, 2016, 38(9): 1812-1828. DOI: 1812

张大坤, 黄翠, 宋国治. 三维片上网络研究综述[J]. 软件学报, 2016, 26(1): 155-187. DOI: 155

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

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

Design of ultra-low power real-time clock circuits

Aerial small object detection algorithm based on improved RT-DETR

Research on assembly action recognition based on MSS-YOLO-MPHands fusion architecture

High gain stability high temperature operational amplifier based on reverse body bias

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.

⁰