删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

考虑任务不确定性的片上网络鲁棒性应用映射问题研究

本站小编 Free考研考试/2022-01-03

闁瑰吋绮庨崒锟�2濞戞挸娲ㄩ~鎺楁嚀閸愵亞鍩¢柤鏉垮暢閻﹀鎮介棃娑氭憤濞戞棑璁g槐娆愶紣濡櫣姘ㄩ柨娑樼焷椤锛愰幋顖滅闁稿繐绉烽崹鍌炴偨閿燂拷
濠㈠爢鍥у姤闁告帒妫涢銏ゆ鐎n喖鍘撮柡鍕靛灣椤戝洦绋夐埀顒€鈻庨檱閳ь剙鍟伴悥娲晬鐏炵瓔鍤犲ù婊冮椤┭勬媴閺囩喓鍙€闁归潧褰炵粭鎾寸▔濮樻剚鍤﹂柟绋挎搐閻i箖寮▎鎰稄闁挎稑鏈崹銊ф媼閸涘﹥绠掔€垫澘鐗嗛ˇ鍧楁偪閹达附锛栭柕鍡曞ree濠㈠綊鈧稒銆冮柛鎺戞椤掔喐绋婇悩鐢电Ч闁兼澘鍟伴悥鍝勄庢潏顐熷亾閺囨氨鐟╁☉鎾翠亢椤曡櫕娼忛崨顓у殼20妤犵偠鎻槐婵嬪箑閼姐倗娉㈠ù婊冩缁夊鈧湱鍋熼弫銈夋儍閸曨剙鐦归悗瑙勭閺嗏偓闁哄鍔栭悡锛勬嫚閵忊剝鐓欐繛澶嬫礀瀵攱寰勫鍕槑闁哄倽顫夌涵鍫曟晬鐏炵偓绠掗梻鍥e亾閻熸洑鑳跺▓鎴︽儑鐎n厾绠栭柡澶涙嫹
王新玉1,,,
李治莹1,
邵帅1,
虞志刚2
1.东北财经大学管理科学与工程学院 ??大连 ??116025
2.中国电子科学研究院 ??北京 ??100041
基金项目:教育部人文社会科学研究一般项目(18YJC630185),国家自然科学基金(61402086, 71501032, 71602021)

详细信息
作者简介:王新玉:女,1985年生,博士,副教授,研究方向为并行分布式计算、智能优化等
李治莹:女,1997年生,本科生,研究方向为智能优化算法等
邵帅:男,1994年生,硕士生,研究方向为应用映射算法等
虞志刚:男,1988年生,博士,研究方向为片上网络路由器设计等
通讯作者:王新玉 Distribute_2008@163.com
中图分类号:TP391

计量

文章访问数:1127
HTML全文浏览量:416
PDF下载量:26
被引次数:0
出版历程

收稿日期:2018-06-20
修回日期:2019-01-09
网络出版日期:2019-01-25
刊出日期:2019-05-01

Robust Application Mapping for Networks-on-chip Considering Uncertainty of Tasks

Xinyu WANG1,,,
Zhiying LI1,
Shuai SHAO1,
Zhigang YU2
1. School of Management Science and Engineering, Dongbei University of Finance and Economics, Dalian 116025, China
2. China Academy of Electronics and Information Technology, Beijing 100041, China
Funds:The General Project of Humanities and Social Sciences Research of the Ministry of Education (18YJC630185), The National Natural Science Foundation of China (61402086, 71501032, 71602021)


摘要
摘要:标准应用映射问题中,每个任务的通信量是确定值,而实际应用中任务通信具有突发性和时变特征,因此将任务通信量建模为不确定值具有现实意义。该文利用区间流法对任务不确定性进行描述,基于保守因子对鲁棒性应用映射问题建模,提出了求解问题的改进禁忌搜索算法(Tabu-RAM),通过5个Benchmark案例对本文模型和算法进行了验证。实验结果表明Tabu-RAM能够求解传统应用映射问题,且优于现有文献中给出的算法。此外,与传统禁忌搜索算法相比,Tabu-RAM算法在求解鲁棒性应用映射问题时具有更好的性能和稳定性。
关键词:片上网络/
应用映射/
不确定性/
区间流/
禁忌搜索
Abstract:In the standard application mapping problem, it is assumed that the communicating traffic of a task is a fixed value. In the real applications, the communication traffic is uncertain due to the time-varying and bursty characters. Therefore, it has the practical significance modeling the task with communicating traffic uncertainty. Given the interval flow and a conservation factor, the robust application mapping problem is formulated by a min-max model, and then solved by a revised Tabu-based algorithm (Tabu-RAM) in this paper. The algorithm is verified under five benchmark instances. As the experimental results show, under the standard application scenarios, the Tabu-RAM performs better than other methods proposed in the literature. In addition, under the application scenarios with uncertain tasks, experimental results show that the Tabu-RAM performs better and more stable than the traditional tabu algorithm.
Key words:Network-on-chip/
Application mapping/
Uncertainty/
Interval flow/
Tabu search



PDF全文下载地址:

https://jeit.ac.cn/article/exportPdf?id=d9ccb0f4-01bf-4f72-bba1-6471455e8b93
相关话题/网络 通信 博士 智能 优化