基于NoC的mpsoc中链路带宽感知回溯的动态任务映射

Changlin Chen, S. Cotofana
{"title":"基于NoC的mpsoc中链路带宽感知回溯的动态任务映射","authors":"Changlin Chen, S. Cotofana","doi":"10.1145/2685342.2685343","DOIUrl":null,"url":null,"abstract":"In Network-on-Chip (NoC) based Multi-Processor Systems-on-Chip (MPSoCs) links, when affected by various dependability factors, may experience bandwidth reduction, which could result in substantial performance penalties if not properly considered within the application mapping process. In this paper, we propose a run-time task mapping algorithm, which takes both the path traffic load and link bandwidth into the consideration and maps applications onto contiguous near convex regions to reduce the internal and external congestion. We rely on backtracking strategy to guaranty that the maximum link traffic load does not exceed a given limit determined by the link bandwidth and a loose factor. To evaluate our proposal we map synthetic (TGFF tool generated) and real video processing applications on partially defective 8×8 NoCs. The experiments indicate that our approach substantially outperforms equivalent state of the art task mapping heuristics when NoC defects are present, e.g., for 5% broken wires, we achieve at least 16% communication cost reduction and 45% shorter average packet transmission latency.","PeriodicalId":344147,"journal":{"name":"Network on Chip Architectures","volume":"60 8","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Link Bandwidth Aware Backtracking Based Dynamic Task Mapping in NoC based MPSoCs\",\"authors\":\"Changlin Chen, S. Cotofana\",\"doi\":\"10.1145/2685342.2685343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Network-on-Chip (NoC) based Multi-Processor Systems-on-Chip (MPSoCs) links, when affected by various dependability factors, may experience bandwidth reduction, which could result in substantial performance penalties if not properly considered within the application mapping process. In this paper, we propose a run-time task mapping algorithm, which takes both the path traffic load and link bandwidth into the consideration and maps applications onto contiguous near convex regions to reduce the internal and external congestion. We rely on backtracking strategy to guaranty that the maximum link traffic load does not exceed a given limit determined by the link bandwidth and a loose factor. To evaluate our proposal we map synthetic (TGFF tool generated) and real video processing applications on partially defective 8×8 NoCs. The experiments indicate that our approach substantially outperforms equivalent state of the art task mapping heuristics when NoC defects are present, e.g., for 5% broken wires, we achieve at least 16% communication cost reduction and 45% shorter average packet transmission latency.\",\"PeriodicalId\":344147,\"journal\":{\"name\":\"Network on Chip Architectures\",\"volume\":\"60 8\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Network on Chip Architectures\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2685342.2685343\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Network on Chip Architectures","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2685342.2685343","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

在基于片上网络(NoC)的多处理器片上系统(mpsoc)链路中,当受到各种可靠性因素的影响时,可能会出现带宽减少,如果在应用程序映射过程中不适当考虑,可能会导致严重的性能损失。在本文中,我们提出了一种运行时任务映射算法,该算法同时考虑了路径流量负载和链路带宽,并将应用映射到相邻的近凸区域,以减少内部和外部的拥塞。我们依靠回溯策略来保证最大链路流量负载不超过由链路带宽和松散因素决定的给定限制。为了评估我们的建议,我们将合成(TGFF工具生成)和真实视频处理应用映射到部分缺陷8×8 noc上。实验表明,当存在NoC缺陷时,我们的方法大大优于等效的最先进的任务映射启发式方法,例如,对于5%的断线,我们实现了至少16%的通信成本降低和45%的平均数据包传输延迟缩短。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link Bandwidth Aware Backtracking Based Dynamic Task Mapping in NoC based MPSoCs
In Network-on-Chip (NoC) based Multi-Processor Systems-on-Chip (MPSoCs) links, when affected by various dependability factors, may experience bandwidth reduction, which could result in substantial performance penalties if not properly considered within the application mapping process. In this paper, we propose a run-time task mapping algorithm, which takes both the path traffic load and link bandwidth into the consideration and maps applications onto contiguous near convex regions to reduce the internal and external congestion. We rely on backtracking strategy to guaranty that the maximum link traffic load does not exceed a given limit determined by the link bandwidth and a loose factor. To evaluate our proposal we map synthetic (TGFF tool generated) and real video processing applications on partially defective 8×8 NoCs. The experiments indicate that our approach substantially outperforms equivalent state of the art task mapping heuristics when NoC defects are present, e.g., for 5% broken wires, we achieve at least 16% communication cost reduction and 45% shorter average packet transmission latency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信