多核环境下并行粒子群优化的性能评价

Eman Abdulaziz Abdullah, Ibrahim Ahmed Saleh, Omar Ibrahim Al Saif
{"title":"多核环境下并行粒子群优化的性能评价","authors":"Eman Abdulaziz Abdullah, Ibrahim Ahmed Saleh, Omar Ibrahim Al Saif","doi":"10.1109/ICOASE.2018.8548816","DOIUrl":null,"url":null,"abstract":"Particle swarm optimization (PSO) has become universal due to its simplicity and effectiveness in solving many problems in various applications with low computational cost. This algorithm consumes time as dealing with large tasks programs. The main goal of this paper is to introduce a parallel particle swarm optimization (PPSO) on multi-core processing kernel to decrease the determination. In order to ease transfer information among particles of shared area and exchange information by switching randomly. Most of serial PSO algorithms allow updating information among particles which takes a long time during the implementation period. The algorithm was applied to the standard optimization test set CEC (Congress on Evolutionary Computation) 2014 and gave good results compared to the previous algorithm. The empirical results show the execution time of Shared-PSO is more efficient than the serial PSO’s. The proposed algorithm using a multicore CPU technique to improve it via parallelization and enhanced the efficiency of an algorithm by increase the range of PSO application.","PeriodicalId":144020,"journal":{"name":"2018 International Conference on Advanced Science and Engineering (ICOASE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Performance Evaluation of Parallel Particle Swarm Optimization for Multicore Environment\",\"authors\":\"Eman Abdulaziz Abdullah, Ibrahim Ahmed Saleh, Omar Ibrahim Al Saif\",\"doi\":\"10.1109/ICOASE.2018.8548816\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Particle swarm optimization (PSO) has become universal due to its simplicity and effectiveness in solving many problems in various applications with low computational cost. This algorithm consumes time as dealing with large tasks programs. The main goal of this paper is to introduce a parallel particle swarm optimization (PPSO) on multi-core processing kernel to decrease the determination. In order to ease transfer information among particles of shared area and exchange information by switching randomly. Most of serial PSO algorithms allow updating information among particles which takes a long time during the implementation period. The algorithm was applied to the standard optimization test set CEC (Congress on Evolutionary Computation) 2014 and gave good results compared to the previous algorithm. The empirical results show the execution time of Shared-PSO is more efficient than the serial PSO’s. The proposed algorithm using a multicore CPU technique to improve it via parallelization and enhanced the efficiency of an algorithm by increase the range of PSO application.\",\"PeriodicalId\":144020,\"journal\":{\"name\":\"2018 International Conference on Advanced Science and Engineering (ICOASE)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Advanced Science and Engineering (ICOASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOASE.2018.8548816\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Advanced Science and Engineering (ICOASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOASE.2018.8548816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

粒子群算法以其简单、有效、计算成本低的特点在各种应用中得到广泛应用。该算法在处理大型任务程序时消耗大量时间。本文的主要目的是在多核处理内核上引入并行粒子群优化算法(PPSO),以减少决策的确定性。为了方便共享区域内粒子间的信息传递,通过随机切换来交换信息。大多数串行粒子群算法允许粒子间的信息更新,但在实现过程中需要花费较长的时间。将该算法应用于2014年CEC (Congress on Evolutionary Computation)标准优化测试集,与之前的算法相比,取得了较好的效果。实验结果表明,共享粒子群算法的执行时间比串行粒子群算法的执行时间更短。该算法采用多核CPU技术,通过并行化对算法进行改进,并通过增加粒子群的应用范围来提高算法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Performance Evaluation of Parallel Particle Swarm Optimization for Multicore Environment
Particle swarm optimization (PSO) has become universal due to its simplicity and effectiveness in solving many problems in various applications with low computational cost. This algorithm consumes time as dealing with large tasks programs. The main goal of this paper is to introduce a parallel particle swarm optimization (PPSO) on multi-core processing kernel to decrease the determination. In order to ease transfer information among particles of shared area and exchange information by switching randomly. Most of serial PSO algorithms allow updating information among particles which takes a long time during the implementation period. The algorithm was applied to the standard optimization test set CEC (Congress on Evolutionary Computation) 2014 and gave good results compared to the previous algorithm. The empirical results show the execution time of Shared-PSO is more efficient than the serial PSO’s. The proposed algorithm using a multicore CPU technique to improve it via parallelization and enhanced the efficiency of an algorithm by increase the range of PSO application.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Proposed Security Evaluator for Cryptosystem Based on Information Theory and Triangular Game Time Sharing Based Parallel Implementation of CNN on Low Cost FPGA Elevation Angle Influence in Geostationary and Non-Geostationary Satellite System Multi-Robot Path Planning Based on Max–Min Ant Colony Optimization and D* Algorithms in a Dynamic Environment Wavelet Denoising Based on Genetic Algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1