{"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}
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.