SID-Mesh: Diagonal Mesh Topology for Silicon Interposer in 2.5D NoC with Introducing a New Routing Algorithm

Babak Sharifpour, Mohammad Sharifpour, M. Reshadi
{"title":"SID-Mesh: Diagonal Mesh Topology for Silicon Interposer in 2.5D NoC with Introducing a New Routing Algorithm","authors":"Babak Sharifpour, Mohammad Sharifpour, M. Reshadi","doi":"10.1109/SLIP52707.2021.00018","DOIUrl":null,"url":null,"abstract":"Silicon interposer technology or 2.5D stacking is an approach to decrease memory access delay. In the 3D stacking method, the memory stacks are placed on top of the processing chip, and it uses Through Silicon Via vertical links, but in the 2.5D method, the stacked memories are placed on the sides of the processing chip, and data transfer is from the network that lays on the silicon interposer. We examine the interposer network topologies in the 2.5D chip and present Diagonal Mesh with a new routing algorithm for the interposer network. The stacked memories are on two sides of the processing chip, so Diagonal Mesh interconnections can reduce the delay in accessing dynamic memory using diagonal links. Symmetry and short diagonal links are the advantages of the Diagonal Mesh compared to the other topologies. According to the simulation results, the Diagonal Mesh average hop count is lower than Concentrated Mesh and Double Butterfly, and the average packet latency is lower than the compared topologies. Diagonal Mesh improved 19.7 percent in the average hop count and 41.17 percent in the network saturation point compared to Concentrated Mesh.","PeriodicalId":358944,"journal":{"name":"2021 ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SLIP52707.2021.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Silicon interposer technology or 2.5D stacking is an approach to decrease memory access delay. In the 3D stacking method, the memory stacks are placed on top of the processing chip, and it uses Through Silicon Via vertical links, but in the 2.5D method, the stacked memories are placed on the sides of the processing chip, and data transfer is from the network that lays on the silicon interposer. We examine the interposer network topologies in the 2.5D chip and present Diagonal Mesh with a new routing algorithm for the interposer network. The stacked memories are on two sides of the processing chip, so Diagonal Mesh interconnections can reduce the delay in accessing dynamic memory using diagonal links. Symmetry and short diagonal links are the advantages of the Diagonal Mesh compared to the other topologies. According to the simulation results, the Diagonal Mesh average hop count is lower than Concentrated Mesh and Double Butterfly, and the average packet latency is lower than the compared topologies. Diagonal Mesh improved 19.7 percent in the average hop count and 41.17 percent in the network saturation point compared to Concentrated Mesh.
SID-Mesh: 2.5D NoC中硅中间层的对角网格拓扑结构,并引入了一种新的路由算法
硅中间层技术或2.5D堆叠是降低存储器访问延迟的一种方法。在3D堆叠方法中,存储器堆栈放置在处理芯片的顶部,并使用Through Silicon Via垂直链接,但在2.5D方法中,堆叠的存储器放置在处理芯片的两侧,数据传输来自铺设在硅中间层上的网络。我们研究了2.5D芯片中的中介网络拓扑结构,并提出了一种新的中介网络路由算法对角网格。堆叠的存储器位于处理芯片的两侧,因此对角网格互连可以减少使用对角链路访问动态存储器的延迟。对称和短对角连接是对角网格相对于其他拓扑的优点。仿真结果表明,对角网的平均跳数低于集中网和双蝴蝶网,平均数据包延迟低于对比拓扑。与集中网格相比,对角网格在平均跳数上提高了19.7%,在网络饱和点上提高了41.17%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信