基于Firefly算法的片上网络拓扑的成本感知任务调度和核心映射

S. Umamaheswari, K. I. Kirthiga, B. Abinaya, D. Ashwin
{"title":"基于Firefly算法的片上网络拓扑的成本感知任务调度和核心映射","authors":"S. Umamaheswari, K. I. Kirthiga, B. Abinaya, D. Ashwin","doi":"10.1109/ICRTIT.2013.6844278","DOIUrl":null,"url":null,"abstract":"An optimal Network on Chip topology is generated with reduced area and power consumption. The Firefly algorithm is used for the optimal mapping of each and every Intellectual Property core in a specific application. This method incorporates multiple objectives subject to some constraints based on the information available in the Communication Task Graph. The paper proceeds with two phases. In the first phase the tasks are mapped on the processors and in the second phase the processors are mapped on the network tiles.","PeriodicalId":113531,"journal":{"name":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Cost aware task scheduling and core mapping on Network-on-Chip topology using Firefly algorithm\",\"authors\":\"S. Umamaheswari, K. I. Kirthiga, B. Abinaya, D. Ashwin\",\"doi\":\"10.1109/ICRTIT.2013.6844278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal Network on Chip topology is generated with reduced area and power consumption. The Firefly algorithm is used for the optimal mapping of each and every Intellectual Property core in a specific application. This method incorporates multiple objectives subject to some constraints based on the information available in the Communication Task Graph. The paper proceeds with two phases. In the first phase the tasks are mapped on the processors and in the second phase the processors are mapped on the network tiles.\",\"PeriodicalId\":113531,\"journal\":{\"name\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Recent Trends in Information Technology (ICRTIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2013.6844278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Recent Trends in Information Technology (ICRTIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2013.6844278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在减小面积和功耗的情况下,生成了最优的片上网络拓扑。萤火虫算法用于在特定应用程序中对每个知识产权核心进行最优映射。该方法基于通信任务图中可用的信息,在一定约束条件下结合多个目标。本文分两个阶段进行。在第一阶段,任务被映射到处理器上,在第二阶段,处理器被映射到网络块上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cost aware task scheduling and core mapping on Network-on-Chip topology using Firefly algorithm
An optimal Network on Chip topology is generated with reduced area and power consumption. The Firefly algorithm is used for the optimal mapping of each and every Intellectual Property core in a specific application. This method incorporates multiple objectives subject to some constraints based on the information available in the Communication Task Graph. The paper proceeds with two phases. In the first phase the tasks are mapped on the processors and in the second phase the processors are mapped on the network tiles.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信