An implementation of Coincidence Algorithm on Graphic Processing Units

Author

Tongsiri, Thitipan ; Chongstitvatana, Prabhas

Author_Institution

Dept. of Comput. Eng., Chulalongkorn Univ., Bangkok, Thailand

fYear

2012

fDate

May 30 2012-June 1 2012

Firstpage

126

Lastpage

130

Abstract

Genetic Algorithms (GAs) are powerful search techniques. However when they are applied to complex problems, they consume large computation power. One of the choices to make them faster is to use a parallel implementation. This paper presents a parallel implementation of Combinatorial Optimisation with Coincidence Algorithm (COIN) on Graphic Processing Units. COIN is a modern GA. It has a wide range of applications. The result from the experiment shows a good speedup in comparison to a sequential implementation on modern processors.

Keywords

combinatorial mathematics; genetic algorithms; graphics processing units; parallel processing; search problems; COIN; GA; GPU; combinatorial optimisation with coincidence algorithm; genetic algorithms; graphics processing units; parallel implementation; search techniques; Central Processing Unit; Computer architecture; Generators; Genetic algorithms; Graphics processing unit; Instruction sets; Kernel; Genetic Algorithm; Graphic Processing Unit; Parallel Processing;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Software Engineering (JCSSE), 2012 International Joint Conference on

Conference_Location

Bangkok

Print_ISBN

978-1-4673-1920-1

Type

conf

DOI

10.1109/JCSSE.2012.6261938

Filename

6261938