{"title":"基于GPU平台的高性能APSO算法实现","authors":"Seyyedeh Hamideh Sojoudi Ziyabari, A. Shahbahrami","doi":"10.1109/AISP.2015.7123524","DOIUrl":null,"url":null,"abstract":"Optimization can be defined as the act of getting the best result under given circumstances. Evolutionary algorithms are widely used for solving optimization problems. One of these evolutionary algorithms is Particle Swarm Optimization (PSO). Different kinds of PSO such as Adaptive Particle Swarm Optimization (APSO), have been presented to improve the original PSO and eliminate its disadvantages. Although APSO can overcome the problem of premature convergence and accelerate the convergence speed at the same time, it is computationally intensive because of its nested loops. The goal of this paper is high performance implementation of APSO algorithm based on GPU. In order to analyze this algorithm and evaluate its computational time, we have implemented APSO on both CPU and GPU. Different parallelisms such as loop-level parallelism have been exploited and we have achieved significant speedup up to 152x compared to CPU based implementation.","PeriodicalId":405857,"journal":{"name":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"High performance implementation of APSO algorithm using GPU platform\",\"authors\":\"Seyyedeh Hamideh Sojoudi Ziyabari, A. Shahbahrami\",\"doi\":\"10.1109/AISP.2015.7123524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimization can be defined as the act of getting the best result under given circumstances. Evolutionary algorithms are widely used for solving optimization problems. One of these evolutionary algorithms is Particle Swarm Optimization (PSO). Different kinds of PSO such as Adaptive Particle Swarm Optimization (APSO), have been presented to improve the original PSO and eliminate its disadvantages. Although APSO can overcome the problem of premature convergence and accelerate the convergence speed at the same time, it is computationally intensive because of its nested loops. The goal of this paper is high performance implementation of APSO algorithm based on GPU. In order to analyze this algorithm and evaluate its computational time, we have implemented APSO on both CPU and GPU. Different parallelisms such as loop-level parallelism have been exploited and we have achieved significant speedup up to 152x compared to CPU based implementation.\",\"PeriodicalId\":405857,\"journal\":{\"name\":\"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-03-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AISP.2015.7123524\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 The International Symposium on Artificial Intelligence and Signal Processing (AISP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AISP.2015.7123524","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
High performance implementation of APSO algorithm using GPU platform
Optimization can be defined as the act of getting the best result under given circumstances. Evolutionary algorithms are widely used for solving optimization problems. One of these evolutionary algorithms is Particle Swarm Optimization (PSO). Different kinds of PSO such as Adaptive Particle Swarm Optimization (APSO), have been presented to improve the original PSO and eliminate its disadvantages. Although APSO can overcome the problem of premature convergence and accelerate the convergence speed at the same time, it is computationally intensive because of its nested loops. The goal of this paper is high performance implementation of APSO algorithm based on GPU. In order to analyze this algorithm and evaluate its computational time, we have implemented APSO on both CPU and GPU. Different parallelisms such as loop-level parallelism have been exploited and we have achieved significant speedup up to 152x compared to CPU based implementation.