Energy-aware Mapping for Tree-based NoC Architectures by Recursive Bipartitioning

Zhengwei Chang, Guang-ze Xiong, Nan Sang
{"title":"Energy-aware Mapping for Tree-based NoC Architectures by Recursive Bipartitioning","authors":"Zhengwei Chang, Guang-ze Xiong, Nan Sang","doi":"10.1109/ICESS.2008.50","DOIUrl":null,"url":null,"abstract":"In this paper, we present an approach to map intellectual property (IP) cores onto tree based network-on-chip (NoC) architecture such that the total communication energy is minimized. We first formulate the problem of energy-aware mapping, and then propose a recursive bipartitioning algorithm to solve it. The proposed technique is an efficient divide-and-conquer approach, based on the Kernighan-Lin mincut bisection heuristic. Experimental results show that the recursive bipartitioning method is very fast and effective, so it is suited to both quick design space exploration and producing excellent results.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Embedded Software and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICESS.2008.50","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper, we present an approach to map intellectual property (IP) cores onto tree based network-on-chip (NoC) architecture such that the total communication energy is minimized. We first formulate the problem of energy-aware mapping, and then propose a recursive bipartitioning algorithm to solve it. The proposed technique is an efficient divide-and-conquer approach, based on the Kernighan-Lin mincut bisection heuristic. Experimental results show that the recursive bipartitioning method is very fast and effective, so it is suited to both quick design space exploration and producing excellent results.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于递归双分区的树状NoC体系结构能量感知映射
在本文中,我们提出了一种将知识产权(IP)核映射到基于树的片上网络(NoC)架构上的方法,从而使总通信能量最小化。我们首先提出了能量感知映射问题,然后提出了一种递归双分区算法来解决这个问题。所提出的技术是一种有效的分治方法,基于Kernighan-Lin最小分割启发式。实验结果表明,递归双分区方法快速有效,既适合于快速的设计空间探索,又能产生优异的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Efficient Multi-protocol RFID Interrogator Baseband Processor based on a Reconfigurable Architecture Schedulability Analysis for Fault-Tolerant Hard Real-Time Tasks with Arbitrary Large Deadlines Energy Efficiency of Scratch-Pad Memory at 65 nm and Below: An Empirical Study Formal Schedulability Analysis and Simulation for AADL An Entropy-based Trust Modeling and Evaluation for Wireless Sensor Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1