Hongxia Xia, Jun Zhang, Xianming Zhao, Huazhu Song
{"title":"Application of Discrete Particle Swarm Optimaization for Service Selection in Grid","authors":"Hongxia Xia, Jun Zhang, Xianming Zhao, Huazhu Song","doi":"10.1109/APPED.2010.9","DOIUrl":null,"url":null,"abstract":"Service selection plays a very important role in the grid middleware. Firstly, a service redundancy strategy is adapted and the corresponding target equation is designed for improving the QoS of the whole workflows in the grid. Secondly, considering of determining a optimal service schema virtually belongs to a combinatorial optimization problem, a resolving algorithm based on discrete particle swarm optimization to find a global optimum is proposed, and its encoding methods are given, In which, the suitable parameters in the algorithm are decided through the adjustment experiments. Finally, the results of some experiments show that the algorithm is feasible, and compared with some other algorithms, such as local optimization, greedy algorithm etc, the algorithm in the paper is more effective.","PeriodicalId":129691,"journal":{"name":"2010 Asia-Pacific Conference on Power Electronics and Design","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Asia-Pacific Conference on Power Electronics and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APPED.2010.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Service selection plays a very important role in the grid middleware. Firstly, a service redundancy strategy is adapted and the corresponding target equation is designed for improving the QoS of the whole workflows in the grid. Secondly, considering of determining a optimal service schema virtually belongs to a combinatorial optimization problem, a resolving algorithm based on discrete particle swarm optimization to find a global optimum is proposed, and its encoding methods are given, In which, the suitable parameters in the algorithm are decided through the adjustment experiments. Finally, the results of some experiments show that the algorithm is feasible, and compared with some other algorithms, such as local optimization, greedy algorithm etc, the algorithm in the paper is more effective.