10074

Parallelization of SAT Algorithms on GPUs

Carlos Costa
Instituto Superior Tecnico
Technical report, INESC-ID / Instituto Superior Tecnico, Technical University of Lsibon (UTL), 2013
@article{costa2013parallelization,

   title={Parallelization of SAT Algorithms on GPUs},

   author={Costa, Carlos},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

721

views

The Boolean Satisfability Problem is one of the most important problems in computer science with applications spanning many areas of research. Despite this importance and the extensive study and improvements that have been made, no efficient solution to the problem has been found to the date. During the last years, nVidia introduced CUDA, a platform which lets developers take advantage of the great computing power of the GPUs, that was once unavailable to use. In this work, we propose a methodology of using GPUs to accelerate the resolution of the SAT problem. Since the problem does not map well the GPU paradigm, we will explain our approach, which uses both the GPU and the CPU to solve the parts that suit them the best. We also propose developing a novel SAT solver, capable of solving current benchmark problems, as well as most industry problems.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

Follow us on Twitter

HGPU group

1863 peoples are following HGPU @twitter

Like us on Facebook

HGPU group

406 people like HGPU on Facebook

HGPU group © 2010-2016 hgpu.org

All rights belong to the respective authors

Contact us: