Over Looped 2d Mesh Topology for Network on Chip

A.Singara RajivaLochana, K. Arthi
{"title":"Over Looped 2d Mesh Topology for Network on Chip","authors":"A.Singara RajivaLochana, K. Arthi","doi":"10.1109/ICIICT1.2019.8741472","DOIUrl":null,"url":null,"abstract":"The arrangements of nodes in the network identifies the complexity of the network. To reduce the complexity, a structural arrangements of nodes has to be taken care. The mesh topology yields attraction than the other traditional topologies. Making the opposite corner nodes to communicate with less hops and avoiding the centre of the networks traffic, Over-Looped 2D Mesh Topology is proposed. For a homogeneous systems the proposed work can be deployed without altering any of the switch component compositions. By making the flits, travel in the outer corner nodes with the help of looping nodes will make the journey from source to destination with less hops. For smaller network below 4x4 the looping is less responsive. For odd or even number of columns and rows the looping can be done. The number of columns and number of rows need not to be equal. The left over nodes will be looped accordingly. The hop count of the Over-Looped 2D Mesh Topology compared to 2D mesh decreases the journey by 25%. The wiring segmentation and the wiring length of the system more than 10 % from 2D mesh and less than 20% from 2D Torus.","PeriodicalId":118897,"journal":{"name":"2019 1st International Conference on Innovations in Information and Communication Technology (ICIICT)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Innovations in Information and Communication Technology (ICIICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIICT1.2019.8741472","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The arrangements of nodes in the network identifies the complexity of the network. To reduce the complexity, a structural arrangements of nodes has to be taken care. The mesh topology yields attraction than the other traditional topologies. Making the opposite corner nodes to communicate with less hops and avoiding the centre of the networks traffic, Over-Looped 2D Mesh Topology is proposed. For a homogeneous systems the proposed work can be deployed without altering any of the switch component compositions. By making the flits, travel in the outer corner nodes with the help of looping nodes will make the journey from source to destination with less hops. For smaller network below 4x4 the looping is less responsive. For odd or even number of columns and rows the looping can be done. The number of columns and number of rows need not to be equal. The left over nodes will be looped accordingly. The hop count of the Over-Looped 2D Mesh Topology compared to 2D mesh decreases the journey by 25%. The wiring segmentation and the wiring length of the system more than 10 % from 2D mesh and less than 20% from 2D Torus.
片上网络的过环二维网格拓扑
网络中节点的排列方式反映了网络的复杂程度。为了降低复杂性,必须注意节点的结构安排。网状拓扑结构比其他传统拓扑结构更有吸引力。提出了一种环形二维网格拓扑结构,使相对角节点之间的通信跳数更少,避免了网络流量的中心。对于同构系统,可以在不改变任何开关组件组合的情况下部署所建议的工作。通过飞行,在外角节点上的旅行在环路节点的帮助下,将使从源到目的地的旅行以更少的跳数。对于小于4 × 4的较小网络,环路响应较差。对于奇数或偶数的列和行,可以进行循环。列数和行数不必相等。剩下的节点将相应地循环。与2D网格相比,overloop 2D Mesh拓扑的跳数减少了25%的行程。该系统的布线分割和布线长度大于10%来自二维网格,小于20%来自二维环面。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信