Task Mapping in Heterogeneous MPSoCs for System Level Design

K. Vivekanandarajah, S. K. Pilakkat
{"title":"Task Mapping in Heterogeneous MPSoCs for System Level Design","authors":"K. Vivekanandarajah, S. K. Pilakkat","doi":"10.1109/ICECCS.2008.18","DOIUrl":null,"url":null,"abstract":"This paper investigates automatic mapping of application-to-architecture in heterogeneous Multi Processor System on a Chip (MPSoC), a key problem in system level design of embedded systems. An algorithm is proposed to optimally solve this application-to-architecture mapping problem. The proposed algorithm uses efficient branch-and-bound approach to partition the problem into sub problems and solves them. In addition, we also propose simple heuristics for generating good initial solution and bounds such that the convergence of branch and bound algorithm is fast. Our experiments with randomly generated benchmarks show that the proposed algorithm is efficient and able to map the application-to-architecture with less number of branching.","PeriodicalId":186804,"journal":{"name":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCS.2008.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

This paper investigates automatic mapping of application-to-architecture in heterogeneous Multi Processor System on a Chip (MPSoC), a key problem in system level design of embedded systems. An algorithm is proposed to optimally solve this application-to-architecture mapping problem. The proposed algorithm uses efficient branch-and-bound approach to partition the problem into sub problems and solves them. In addition, we also propose simple heuristics for generating good initial solution and bounds such that the convergence of branch and bound algorithm is fast. Our experiments with randomly generated benchmarks show that the proposed algorithm is efficient and able to map the application-to-architecture with less number of branching.
面向系统级设计的异构mpsoc任务映射
本文研究了异构多处理器单片系统(MPSoC)中应用到体系结构的自动映射,这是嵌入式系统系统级设计中的一个关键问题。提出了一种优化解决应用到体系结构映射问题的算法。该算法采用高效的分支定界方法将问题划分为子问题并求解。此外,我们还提出了简单的启发式方法来生成良好的初始解和界,使得分支定界算法的收敛速度很快。我们对随机生成的基准进行的实验表明,所提出的算法是有效的,并且能够以较少的分支数量将应用程序映射到体系结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信