Evaluation of hop count advantages of network-coded 2D-mesh NoCs

Michael Vonbun, Stefan Wallentowitz, M. Feilen, W. Stechele, A. Herkersdorf
{"title":"Evaluation of hop count advantages of network-coded 2D-mesh NoCs","authors":"Michael Vonbun, Stefan Wallentowitz, M. Feilen, W. Stechele, A. Herkersdorf","doi":"10.1109/PATMOS.2013.6662166","DOIUrl":null,"url":null,"abstract":"Network-on-Chip (NoC) have become favorable for on-chip communication, especially with the ever rising number of communication partners in future manycore system-on-chip. NoCs that are based on mesh topologies with dimension-routing are well-established as they scale well with the increasing number of communication partners and allow efficient router design. To be able to serve application demands with efficiency, sophisticated features such as multicasting become an increasingly important factor in future NoC-based systems. The 2D-mesh/dimension-routing combination, however, suffers from performance degradation especially in the case of multicast communication as the network infrastructure is utilized suboptimally. Approaching this problem, we investigate the potential of network-coded Network-on-Chip (ncNoC) compared to classical 2D-mesh/dimension-routing NoCs. We adapt a high level evaluation method to compute the minimum hop count equivalent using network coding which enables us to compare network-coded and dimension-routed hop count cost. Within this environment we can demonstrate the full potential of network coding for both the butterfly and generalized multicast connection settings. We can show that network coding is never outperformed by dimension-routing in terms of required hop counts and, more important, identify multi-source scenarios with only a limited number of sinks per source to be the most advantageous connection settings for coded NoCs.","PeriodicalId":287176,"journal":{"name":"2013 23rd International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 23rd International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PATMOS.2013.6662166","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Network-on-Chip (NoC) have become favorable for on-chip communication, especially with the ever rising number of communication partners in future manycore system-on-chip. NoCs that are based on mesh topologies with dimension-routing are well-established as they scale well with the increasing number of communication partners and allow efficient router design. To be able to serve application demands with efficiency, sophisticated features such as multicasting become an increasingly important factor in future NoC-based systems. The 2D-mesh/dimension-routing combination, however, suffers from performance degradation especially in the case of multicast communication as the network infrastructure is utilized suboptimally. Approaching this problem, we investigate the potential of network-coded Network-on-Chip (ncNoC) compared to classical 2D-mesh/dimension-routing NoCs. We adapt a high level evaluation method to compute the minimum hop count equivalent using network coding which enables us to compare network-coded and dimension-routed hop count cost. Within this environment we can demonstrate the full potential of network coding for both the butterfly and generalized multicast connection settings. We can show that network coding is never outperformed by dimension-routing in terms of required hop counts and, more important, identify multi-source scenarios with only a limited number of sinks per source to be the most advantageous connection settings for coded NoCs.
网络编码二维网格noc跳数优势评价
随着未来多核片上系统通信伙伴数量的不断增加,片上网络(NoC)已成为片上通信的有利条件。基于具有维度路由的网状拓扑的noc已经建立,因为它们可以很好地随通信伙伴数量的增加而扩展,并允许高效的路由器设计。为了能够高效地满足应用程序需求,诸如多播之类的复杂功能将成为未来基于网络的系统中越来越重要的因素。然而,2d网格/维度路由组合受到性能下降的影响,特别是在多播通信的情况下,因为网络基础设施的利用率不是最佳的。为了解决这个问题,我们研究了网络编码的片上网络(ncNoC)与经典2d网格/维度路由noc的潜力。我们采用一种高层次的评估方法来计算网络编码的最小跳数当量,使我们能够比较网络编码和维度路由的跳数成本。在这种环境中,我们可以展示网络编码在蝴蝶和广义多播连接设置方面的全部潜力。我们可以证明,就所需的跳数而言,网络编码永远不会被维度路由超越,更重要的是,我们确定了每个源只有有限数量的接收器的多源方案,这是编码noc的最有利的连接设置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信