DocumentCode :
3209997
Title :
Communication Latency Tolerant Parallel Algorithm for Particle Swarm Optimization
Author :
Li, Bo ; Wada, Koichi
Author_Institution :
Dept. of Comput. Sci., Univ. of Tsukuba, Tsukuba, Japan
fYear :
2009
fDate :
17-19 Dec. 2009
Firstpage :
68
Lastpage :
74
Abstract :
Particle swarm optimization (PSO) algorithm is a population-based algorithm for finding the optimal solution. Because of its simplicity and high efficiency, PSO is gaining attention in solving complex and large scale problems. However, PSO often requires long execution time to solve those problems. This paper proposes a parallel PSO algorithm, called delayed exchange parallelization, which improves performance of PSO on distributed environment by hiding communication latency efficiently. By overlapping communication with computation, the proposed algorithm extracts parallelism inherent in PSO. The performance of our proposed parallel PSO algorithm was evaluated using several applications. The results of evaluation showed that the proposed parallel algorithm drastically improved the performance of PSO, especially in high-latency network environment.
Keywords :
parallel algorithms; particle swarm optimisation; PSO algorithm; communication latency hiding; communication latency tolerant parallel algorithm; delayed exchange parallelization; parallel algorithm; particle swarm optimization; Communications technology; Computer science; Concurrent computing; Delay; Design optimization; Iterative algorithms; Large-scale systems; Parallel algorithms; Parallel processing; Particle swarm optimization; communication latency; parallel; particle swarm optimization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Frontier of Computer Science and Technology, 2009. FCST '09. Fourth International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-0-7695-3932-4
Electronic_ISBN :
978-1-4244-5467-9
Type :
conf
DOI :
10.1109/FCST.2009.61
Filename :
5392934
Link To Document :
بازگشت