异构计算系统任务匹配的负载再平衡粒子群启发式算法

Manitpal S. Sidhu, P. Thulasiraman, R. Thulasiram
{"title":"异构计算系统任务匹配的负载再平衡粒子群启发式算法","authors":"Manitpal S. Sidhu, P. Thulasiraman, R. Thulasiram","doi":"10.1109/SIS.2013.6615176","DOIUrl":null,"url":null,"abstract":"The idea of utilizing nature inspired algorithms to find optimal solutions to various real world NP complete optimization problems has been extensively explored by researchers. One such problem is task matching problem in heterogeneous distributed computing environments like Grid and Cloud. Researchers have explored Swarm Intelligence algorithm, Particle Swarm Optimization (PSO), to find optimal solution for task matching problem. In this study, we investigate the effectiveness of smallest position value (SPV) technique in mapping continuous version of PSO algorithm to the task matching problem in a heterogeneous computing environment. We show that the task matching generated by this technique will result in in-efficient resource utilization. Thus, we present a novel load rebalance based particle swarm optimization heuristic (PSO-LR) for efficient load distribution among available compute nodes even in heterogeneous computing environments.","PeriodicalId":444765,"journal":{"name":"2013 IEEE Symposium on Swarm Intelligence (SIS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"A load-rebalance PSO heuristic for task matching in heterogeneous computing systems\",\"authors\":\"Manitpal S. Sidhu, P. Thulasiraman, R. Thulasiram\",\"doi\":\"10.1109/SIS.2013.6615176\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The idea of utilizing nature inspired algorithms to find optimal solutions to various real world NP complete optimization problems has been extensively explored by researchers. One such problem is task matching problem in heterogeneous distributed computing environments like Grid and Cloud. Researchers have explored Swarm Intelligence algorithm, Particle Swarm Optimization (PSO), to find optimal solution for task matching problem. In this study, we investigate the effectiveness of smallest position value (SPV) technique in mapping continuous version of PSO algorithm to the task matching problem in a heterogeneous computing environment. We show that the task matching generated by this technique will result in in-efficient resource utilization. Thus, we present a novel load rebalance based particle swarm optimization heuristic (PSO-LR) for efficient load distribution among available compute nodes even in heterogeneous computing environments.\",\"PeriodicalId\":444765,\"journal\":{\"name\":\"2013 IEEE Symposium on Swarm Intelligence (SIS)\",\"volume\":\"112 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Symposium on Swarm Intelligence (SIS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIS.2013.6615176\",\"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 IEEE Symposium on Swarm Intelligence (SIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIS.2013.6615176","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

利用自然启发的算法来寻找各种现实世界NP完全优化问题的最优解的想法已经被研究人员广泛探索。其中一个问题就是网格和云等异构分布式计算环境中的任务匹配问题。研究人员探索了群体智能算法——粒子群优化算法(PSO)来寻找任务匹配问题的最优解。在本研究中,我们研究了最小位置值(SPV)技术在将PSO算法的连续版本映射到异构计算环境中的任务匹配问题中的有效性。我们表明,由该技术生成的任务匹配将导致低效的资源利用。因此,我们提出了一种新的基于负载再平衡的粒子群优化启发式算法(PSO-LR),以便在异构计算环境中有效地在可用计算节点之间分配负载。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A load-rebalance PSO heuristic for task matching in heterogeneous computing systems
The idea of utilizing nature inspired algorithms to find optimal solutions to various real world NP complete optimization problems has been extensively explored by researchers. One such problem is task matching problem in heterogeneous distributed computing environments like Grid and Cloud. Researchers have explored Swarm Intelligence algorithm, Particle Swarm Optimization (PSO), to find optimal solution for task matching problem. In this study, we investigate the effectiveness of smallest position value (SPV) technique in mapping continuous version of PSO algorithm to the task matching problem in a heterogeneous computing environment. We show that the task matching generated by this technique will result in in-efficient resource utilization. Thus, we present a novel load rebalance based particle swarm optimization heuristic (PSO-LR) for efficient load distribution among available compute nodes even in heterogeneous computing environments.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信