{"title":"利用OpenCL和CUDA在GPU上并行实现MOPSO","authors":"J. Arun, Manoj Mishra, Sheshasayee V. Subramaniam","doi":"10.1109/HiPC.2011.6152719","DOIUrl":null,"url":null,"abstract":"GPUs have brought supercomputing-at-desk by offering hundreds of processing cores at a very cheap cost. This has motivated researchers to implement and test parallel solutions to compute-intensive problems on GPU. Most real-world optimization problems are NP-hard and therefore compute intensive. Meta-heuristics are frequently used to solve these optimization problems. Multi-Objective particle swarm optimization (MOPSO) is one of the Meta-heuristic that has attracted many researchers due to its accuracy and simplicity. In last couple of years, many parallel implementations of MOPSO have been proposed in literature. However none of the researchers have implemented and tested performance of MOPSO on GPU. In this paper, we describe our implementation of MOPSO on GPU using CUDA and OpenCL, two of the most popular GPU frameworks for writing parallel applications. The performance of both implementations has been compared with sequential implementation of MOPSO through simulations. Resul ts show that performance can be improved by 90 percent using these parallel implementations. We then present a parallel archi ving technique and implement MOPSO in GPU with the proposed archiving technique using CUDA. Simulation results show that the parallel archiving technique further improves the speedup.","PeriodicalId":122468,"journal":{"name":"2011 18th International Conference on High Performance Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Parallel implementation of MOPSO on GPU using OpenCL and CUDA\",\"authors\":\"J. Arun, Manoj Mishra, Sheshasayee V. Subramaniam\",\"doi\":\"10.1109/HiPC.2011.6152719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"GPUs have brought supercomputing-at-desk by offering hundreds of processing cores at a very cheap cost. This has motivated researchers to implement and test parallel solutions to compute-intensive problems on GPU. Most real-world optimization problems are NP-hard and therefore compute intensive. Meta-heuristics are frequently used to solve these optimization problems. Multi-Objective particle swarm optimization (MOPSO) is one of the Meta-heuristic that has attracted many researchers due to its accuracy and simplicity. In last couple of years, many parallel implementations of MOPSO have been proposed in literature. However none of the researchers have implemented and tested performance of MOPSO on GPU. In this paper, we describe our implementation of MOPSO on GPU using CUDA and OpenCL, two of the most popular GPU frameworks for writing parallel applications. The performance of both implementations has been compared with sequential implementation of MOPSO through simulations. Resul ts show that performance can be improved by 90 percent using these parallel implementations. We then present a parallel archi ving technique and implement MOPSO in GPU with the proposed archiving technique using CUDA. Simulation results show that the parallel archiving technique further improves the speedup.\",\"PeriodicalId\":122468,\"journal\":{\"name\":\"2011 18th International Conference on High Performance Computing\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 18th International Conference on High Performance Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HiPC.2011.6152719\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 18th International Conference on High Performance Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HiPC.2011.6152719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel implementation of MOPSO on GPU using OpenCL and CUDA
GPUs have brought supercomputing-at-desk by offering hundreds of processing cores at a very cheap cost. This has motivated researchers to implement and test parallel solutions to compute-intensive problems on GPU. Most real-world optimization problems are NP-hard and therefore compute intensive. Meta-heuristics are frequently used to solve these optimization problems. Multi-Objective particle swarm optimization (MOPSO) is one of the Meta-heuristic that has attracted many researchers due to its accuracy and simplicity. In last couple of years, many parallel implementations of MOPSO have been proposed in literature. However none of the researchers have implemented and tested performance of MOPSO on GPU. In this paper, we describe our implementation of MOPSO on GPU using CUDA and OpenCL, two of the most popular GPU frameworks for writing parallel applications. The performance of both implementations has been compared with sequential implementation of MOPSO through simulations. Resul ts show that performance can be improved by 90 percent using these parallel implementations. We then present a parallel archi ving technique and implement MOPSO in GPU with the proposed archiving technique using CUDA. Simulation results show that the parallel archiving technique further improves the speedup.