Cellular Genetic Algorithms and Local Search for 3-SAT problem on Graphic Hardware

Author

Luo, Zhongwen ; Liu, Hongzhi

Author_Institution

China Univ. of Geosci., Wuhan

fYear

0

fDate

0-0 0

Firstpage

2988

Lastpage

2992

Abstract

As a well known NP-hard problem, SAT problem is widely discussed by computer science society. In this paper, two common algorithms for SAT problems are implemented based on graphic hardware. They are greedy local search and genetic algorithm. After a brief description of the basic algorithm, we give our modification of the algorithm for fitting with graphic hardware´s SIMD model. Then some implementation details and tricks for graphic hardware are given. At last testing result are given. We compared the performance of graphic hardware based computation with CPU based computation. The result shows a performance improvement on graphic hardware over ordinary CPU.

Keywords

computability; computational complexity; computer graphic equipment; convergence; genetic algorithms; greedy algorithms; mathematics computing; parallel algorithms; search problems; 3-SAT problem; NP-hard problem; cellular genetic algorithms; convergence; graphic hardware SIMD model; greedy local search; Central Processing Unit; Computer graphics; Computer science; Concurrent computing; Genetic algorithms; Geology; Hardware; NP-hard problem; Processor scheduling; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2006. CEC 2006. IEEE Congress on

Conference_Location

Vancouver, BC

Print_ISBN

0-7803-9487-9

Type

conf

DOI

10.1109/CEC.2006.1688685

Filename

1688685