检索结果-内蒙古大学图书馆

The Repetitive Turn Model for Adaptive routing

IEEE TRANSACTIONS ON COMPUTERS 2017年第1期66卷 138-146页

作者： Tang, Minghua Lin, Xiaola Palesi, Maurizio GuangDong Univ Finance Dept Comp Sci & Technol Guangzhou 510521 Guangdong Peoples R China Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China Sun Yat Sen Univ Minist Educ Key Lab Digital Life Guangzhou 510275 Guangdong Peoples R China Univ Enna KORE Enna Italy

For 2D mesh based Network-on-Chip (NoC), the prohibited turns of routing algorithms should be repetitively distributed in order for the routing algorithms to be implemented by logic-based circuit. In this paper, we aim to exploit the designing space for logic-based routing algorithms, and propose new logic-based routing algorithms that outperform the state-of-the-art counterparts. Toward this direction, we firstly construct all routing algorithms for 5 x 5 2D mesh topology. Then we select those routing algorithms which have repetitive prohibited turns across both the network rows and columns. In addition, we chose those routing algorithms that have smaller routing pressures than Odd-Even routing algorithm. Then the routing algorithms for 2D mesh topology ranging from 6 x 6 to 15 x 15 are respectively constructed according to the prohibited turns distribution of the selected routing algorithms. Two routing algorithms that have smaller routing pressures than Odd-Even routing algorithm are obtained for all considered networks. The obtained logic-based routing algorithms are called as Repetitive Turn Model (RTM). Simulation results show that RTM could achieve up to 51% performance improvement as compared to Odd-Even routing algorithm.

关键词： Network-on-Chip routing algorithm routing pressure logic-based routing table-based routing

来源：评论

学校读者我要写书评

暂无评论

Study on Logic-based routing for 3D NOCs 12

Study on Logic-based Routing for 3D NOCs

引用

12th IEEE/ACM International Workshop on Network on Chip Architectures (NoCArc)

作者： Tang, Minghua Palesi, Maurizio GuangDong Univ Finance Dept Internet Finance & Engn Informat Guangzhou Guangdong Peoples R China Univ Catania Dept Elect Elect & Comp Engn Catania Italy

ISBN: (纸本)9781450369497

For mesh-based Network-on-Chip (NoC), in order for a routing algorithm to be implemented by logic-based circuit, the prohibited turns should be repetitively distributed. The 3D mesh network has a huge searching space for routing algorithms. Due to its complexity, there is lack of research to detect its design space. In this paper, the design space for logic-based routing algorithms for 3D mesh network is systematically exploited. After detecting the design space, new logic-based routing algorithm that outperforms the state-of-the-art routing algorithms is proposed. For the first step, all routing algorithms that have repetitively distributed turns for 2D mesh network are constructed. For the second step, the routing algorithms for the three planes of the 3D mesh network are constructed respectively. The Z plane of the 3D mesh network is constructed by placing a 2D network routing on it. The X and Y planes of the 3D mesh network are constructed by rotating the Z plane up or down, respectively. Finally, the constructed routing algorithms are evaluated under 44 traffic scenarios. The best routing algorithm is termed as 3D repetitive turn model (3DRTM). Simulation results show that it has better performance than the prior proposed routing algorithm under most synthetic and real traffic scenarios.

关键词： Network-on-Chip routing algorithm logic-based routing table-based routing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：