RASMAP:一种高效的启发式应用映射算法

Rasoul Seidipiri, A. Patooghy, Sima Afsharpour, M. Fazeli
{"title":"RASMAP:一种高效的启发式应用映射算法","authors":"Rasoul Seidipiri, A. Patooghy, Sima Afsharpour, M. Fazeli","doi":"10.1109/IKT.2016.7777757","DOIUrl":null,"url":null,"abstract":"This paper proposes and evaluates a performance efficient application mapping algorithm for mesh-based NoCs. The proposed algorithm first prioritizes tasks of the given application graph based on their total in/out communication traffic. Then a task with the most communication traffic is selected and mapped onto the center part of the mesh topology i.e., a core with the most available communication channels. After that, repeatedly, the next task is selected in a way that has the most communications with the already mapped tasks. Such a task is mapped onto the core which its degree is proportional to the tasks link degree. The proposed method is evaluated by Noxim which is a cycle-accurate NoC simulator in terms of communication cost i.e., to total number of packets traversed through the network to complete the application graph. The proposed method is compared with several previously proposed mapping algorithms including NMAP, CMAP, LMAP, PSMAP, and CASTNET. Comparisons show that the proposed method offers better performance and consumes lower energy in the network.","PeriodicalId":205496,"journal":{"name":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"RASMAP: An efficient heuristic application mapping algorithm for network-on-chips\",\"authors\":\"Rasoul Seidipiri, A. Patooghy, Sima Afsharpour, M. Fazeli\",\"doi\":\"10.1109/IKT.2016.7777757\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes and evaluates a performance efficient application mapping algorithm for mesh-based NoCs. The proposed algorithm first prioritizes tasks of the given application graph based on their total in/out communication traffic. Then a task with the most communication traffic is selected and mapped onto the center part of the mesh topology i.e., a core with the most available communication channels. After that, repeatedly, the next task is selected in a way that has the most communications with the already mapped tasks. Such a task is mapped onto the core which its degree is proportional to the tasks link degree. The proposed method is evaluated by Noxim which is a cycle-accurate NoC simulator in terms of communication cost i.e., to total number of packets traversed through the network to complete the application graph. The proposed method is compared with several previously proposed mapping algorithms including NMAP, CMAP, LMAP, PSMAP, and CASTNET. Comparisons show that the proposed method offers better performance and consumes lower energy in the network.\",\"PeriodicalId\":205496,\"journal\":{\"name\":\"2016 Eighth International Conference on Information and Knowledge Technology (IKT)\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Eighth International Conference on Information and Knowledge Technology (IKT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IKT.2016.7777757\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Eighth International Conference on Information and Knowledge Technology (IKT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IKT.2016.7777757","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文提出并评估了一种高性能的基于网格的noc应用映射算法。该算法首先根据应用程序图的总输入/输出通信流量对任务进行优先级排序。然后选择通信流量最大的任务并将其映射到网格拓扑的中心部分,即具有最多可用通信通道的核心。在此之后,重复地,以与已映射的任务具有最多通信的方式选择下一个任务。这样的任务被映射到核心上,其程度与任务的链接程度成正比。该方法通过Noxim(一个周期精确的NoC模拟器)在通信成本方面进行了评估,即通过网络遍历的数据包总数来完成应用图。将该方法与NMAP、CMAP、LMAP、PSMAP和CASTNET等几种已有的映射算法进行了比较。比较表明,该方法具有更好的性能和更低的网络能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RASMAP: An efficient heuristic application mapping algorithm for network-on-chips
This paper proposes and evaluates a performance efficient application mapping algorithm for mesh-based NoCs. The proposed algorithm first prioritizes tasks of the given application graph based on their total in/out communication traffic. Then a task with the most communication traffic is selected and mapped onto the center part of the mesh topology i.e., a core with the most available communication channels. After that, repeatedly, the next task is selected in a way that has the most communications with the already mapped tasks. Such a task is mapped onto the core which its degree is proportional to the tasks link degree. The proposed method is evaluated by Noxim which is a cycle-accurate NoC simulator in terms of communication cost i.e., to total number of packets traversed through the network to complete the application graph. The proposed method is compared with several previously proposed mapping algorithms including NMAP, CMAP, LMAP, PSMAP, and CASTNET. Comparisons show that the proposed method offers better performance and consumes lower energy in the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An ontology based data model for Iranian research information QoS-aware provider selection in e-services supply chain Correlation analysis as a dependency measures for inferring of time-lagged gene regulatory network EDSS: An extended deterministic scale-free small world network A modified language modeling method for authorship attribution
×
引用
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