Solution Level Parallelization of Local Search Metaheuristic Algorithm on GPU?Journal: International Journal of Computer Science and Mobile Computing - IJCSMC (Vol.3, No. 7)
Publication Date: 2014-07-30
Authors : S. V. Ghorpade; S. M. Kamalapur;
Page : 268-274
Keywords : Combinatorial Optimization; GPU; Local Search Metaheuristics; Parallel Computing;
Local search metaheuristic algorithms are proven & powerful combinatorial optimization strategies to tackle hard problems like traveling salesman problem. These algorithms explore & evaluate neighbors of a single solution. Time Consuming LSM algorithms can be improved by parallelizing exploration & evaluation of neighbors of a solution. GPU architecture is suitable for algorithms of single program multiple data parallelism. Implemented algorithm reduces time consuming memory transfers and improves computational time by efficient use of memory hierarchy.
Other Latest Articles
Last modified: 2014-07-17 20:11:40