PSO algorithms and GPGPU technique for electromagnetic problems

被引:6
作者
Duca, Anton [1 ]
Duca, Laurentiu [2 ]
Ciuprina, Gabriela [1 ]
Yilmaz, Asim Egemen [3 ]
Altinoz, Tolga [3 ]
机构
[1] Univ Politehn Bucuresti, Fac Elect Engn, Bucharest, Romania
[2] Univ Politehn Bucuresti, Fac Comp Sci, Bucharest, Romania
[3] Ankara Univ, Dept Elect & Elect Engn, Ankara, Turkey
关键词
PSO; GPGPU; electromagnetic field; optimization; TEAM22; PARTICLE SWARM OPTIMIZATION;
D O I
10.3233/JAE-140166
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies the efficiency of the General Purpose Computation on Graphics Processing Units (GPGPU) technique for the implementation of a parallel Particle Swarm Optimization (PSO) algorithm applied for the optimization of electromagnetic field devices. Several sequential PSO algorithms are compared in order to find the optimal configuration of an electromagnetic device, the TEAM22 benchmark electromagnetic problem. The best PSO algorithm is parallelized by using a GPGPU technique using various configurations for kernels and threads per block. Details of the parallel implementations are explained. The sequential and parallel implementations are compared using as criteria the speed up and the solution quality. The most efficient approach turned to be the one with one thread per block, which was up to 4 times faster than a sequential implementation running on hardware architectures with processors much more advanced than the core processors of the GPU.
引用
收藏
页码:S249 / S259
页数:11
相关论文
共 10 条
[1]  
[Anonymous], 2012, hal-00764996
[2]   Defining a standard for particle swarm optimization [J].
Bratton, Daniel ;
Kennedy, James .
2007 IEEE SWARM INTELLIGENCE SYMPOSIUM, 2007, :120-+
[3]   Use of intelligent-particle swarm optimization in electromagnetics [J].
Ciuprina, G ;
Ioan, D ;
Munteanu, I .
IEEE TRANSACTIONS ON MAGNETICS, 2002, 38 (02) :1037-1040
[4]  
Eberhart RC, 2001, IEEE C EVOL COMPUTAT, P81, DOI 10.1109/CEC.2001.934374
[5]   Embedded stochastic-deterministic optimization method with accuracy control [J].
Ioan, D ;
Ciuprina, G ;
Szigeti, A .
IEEE TRANSACTIONS ON MAGNETICS, 1999, 35 (03) :1702-1705
[6]  
Kennedy J, 1995, 1995 IEEE INTERNATIONAL CONFERENCE ON NEURAL NETWORKS PROCEEDINGS, VOLS 1-6, P1942, DOI 10.1109/icnn.1995.488968
[7]   Evaluation of parallel particle swarm optimization algorithms within the CUDA™ architecture [J].
Mussi, Luca ;
Daolio, Fabio ;
Cagnoni, Stefano .
INFORMATION SCIENCES, 2011, 181 (20) :4642-4657
[8]   A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem [J].
Pan, Quan-Ke ;
Tasgetiren, M. Fatih ;
Liang, Yun-Chia .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :2807-2839
[9]   Quantum-behaved particle swarm optimization with Gaussian distributed local attractor point [J].
Sun, Jun ;
Fang, Wei ;
Palade, Vasile ;
Wu, Xiaojun ;
Xu, Wenbo .
APPLIED MATHEMATICS AND COMPUTATION, 2011, 218 (07) :3763-3775
[10]   GPU-based Parallel Particle Swarm Optimization [J].
Zhou, You ;
Tan, Ying .
2009 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-5, 2009, :1493-+