{"title":"Speedup Genetic Algorithm Using C-CUDA","authors":"R. Sinha, Satvir Singh, Sarabjeet Singh, V. Banga","doi":"10.1109/CSNT.2015.148","DOIUrl":null,"url":null,"abstract":"Genetic Algorithm (GA) is one of most popular swarm based evolutionary search algorithm that involves multiple data independent computations. Such computations can be made parallel on GPU cores using Compute Unified Design Architecture (CUDA) platform. In this paper, various operations of GA such as fitness evaluation, selection, crossover and mutation, etc. Are implemented in parallel on GPU cores and then performance is compared with its serial implementation. The algorithm performance in serial and in parallel implementations are examined on a test bed of well-known benchmark optimization functions. The performances are analyzed with varying parameters viz. (i)population sizes, (ii) dimensional sizes, and (iii) problems of differing complexities. Results shows that the overall computational time can substantially be decreased by parallel implementation on GPU cores. The proposed implementations resulted in 1.18 to 4.15 times faster than the corresponding serial implementation on CPU.","PeriodicalId":334733,"journal":{"name":"2015 Fifth International Conference on Communication Systems and Network Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Fifth International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2015.148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
Genetic Algorithm (GA) is one of most popular swarm based evolutionary search algorithm that involves multiple data independent computations. Such computations can be made parallel on GPU cores using Compute Unified Design Architecture (CUDA) platform. In this paper, various operations of GA such as fitness evaluation, selection, crossover and mutation, etc. Are implemented in parallel on GPU cores and then performance is compared with its serial implementation. The algorithm performance in serial and in parallel implementations are examined on a test bed of well-known benchmark optimization functions. The performances are analyzed with varying parameters viz. (i)population sizes, (ii) dimensional sizes, and (iii) problems of differing complexities. Results shows that the overall computational time can substantially be decreased by parallel implementation on GPU cores. The proposed implementations resulted in 1.18 to 4.15 times faster than the corresponding serial implementation on CPU.