A power-efficient network on-chip topology

J. Camacho, J. Flich, J. Duato, H. Eberle, Wladek Olesinski
{"title":"A power-efficient network on-chip topology","authors":"J. Camacho, J. Flich, J. Duato, H. Eberle, Wladek Olesinski","doi":"10.1145/1930037.1930044","DOIUrl":null,"url":null,"abstract":"NoCs have become a critical component in many-core architectures. Usually, the preferred topology is the 2D-Mesh as it enables a tile-based layout significantly reducing the design effort. However, new emerging challenges such as power consumption need to be addressed. Looking at the NoC, routers and links not being used must be switched off, thus achieving large power savings. Topology and routing algorithm must be carefully designed as they may lack enough flexibility to switch off components for long periods of time.\n We present the NR-Mesh (Nearest neighboR Mesh) topology. It gives an end node the choice to inject a message through different neighboring routers, thereby reducing hop count and saving latency. At the receiver side, a message may be delivered to the end node through different routers, thus reducing hop count further and increasing flexibility. When allowing links and routers to switch off and combined with adaptive routing, the power management technique is able to achieve significant power savings (up to 36% savings in static power consumed at routers). When compared with the 2D-Mesh, NR-Mesh reduces execution time by 23% and power consumption at routers by 47%.","PeriodicalId":420489,"journal":{"name":"INA-OCMC '11","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"INA-OCMC '11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1930037.1930044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

NoCs have become a critical component in many-core architectures. Usually, the preferred topology is the 2D-Mesh as it enables a tile-based layout significantly reducing the design effort. However, new emerging challenges such as power consumption need to be addressed. Looking at the NoC, routers and links not being used must be switched off, thus achieving large power savings. Topology and routing algorithm must be carefully designed as they may lack enough flexibility to switch off components for long periods of time. We present the NR-Mesh (Nearest neighboR Mesh) topology. It gives an end node the choice to inject a message through different neighboring routers, thereby reducing hop count and saving latency. At the receiver side, a message may be delivered to the end node through different routers, thus reducing hop count further and increasing flexibility. When allowing links and routers to switch off and combined with adaptive routing, the power management technique is able to achieve significant power savings (up to 36% savings in static power consumed at routers). When compared with the 2D-Mesh, NR-Mesh reduces execution time by 23% and power consumption at routers by 47%.
低功耗的片上网络拓扑结构
noc已经成为许多核心架构中的关键组件。通常,首选的拓扑结构是2D-Mesh,因为它支持基于tile的布局,大大减少了设计工作量。然而,需要解决诸如功耗等新出现的挑战。看看NoC,不使用的路由器和链路必须关闭,从而实现大量的电力节省。拓扑和路由算法必须仔细设计,因为它们可能缺乏足够的灵活性,无法长时间关闭组件。我们提出了NR-Mesh(最近邻网格)拓扑。它使终端节点可以选择通过不同的相邻路由器注入消息,从而减少跳数并节省延迟。在接收端,一条消息可以通过不同的路由器传递到终端节点,从而进一步减少跳数,增加灵活性。当允许链路和路由器关闭并与自适应路由相结合时,电源管理技术能够实现显著的功耗节省(在路由器上消耗的静态功耗节省高达36%)。与2D-Mesh相比,NR-Mesh减少了23%的执行时间和47%的路由器功耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信