GPU4SAT: solving the SAT problem on GPU
نویسندگان
چکیده
The performance of Graphics Processing Units (GPU) has increased in an impressive way in the last few years. The explosion of their computational capacity fascinates various scientific communities. However, programming style must be adapted to fully exploit this massively parallel architecture, which is not necessarily straightforward. This article proposes a first GPU approach for solving the well-known SAT problem. The adaptation phases are detailed, including the problem memory representation and the resolution methods. This approach has been compared with the Walksat method on a standard CPU. This enables us to test our representation of the problem and resolution method on various SAT formula. It also leads to a comparative study of the computational capacity of the most recent generations of CPU’s and GPU’s.
منابع مشابه
NVIDA CUDA Architecture-Based Parallel SAT Solver
The SAT problem is the first NP-complete problem. So far there is no algorithm that can solve it in polynomial time. Over the past decade, the development of efficient and scalable algorithms has dramatically leveraged the ability of solving SAT problem instances involving tens of thousands of variables and millions of constraints. But as industry demand is increasing, a faster SAT solver is ne...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملParallelization of SAT Algorithms on GPUs
The Boolean Satisfability Problem is one of the most important problems in computer science with applications spannig 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 gr...
متن کاملApplication of CUDA in the Boolean Domain for the Unate Covering Problem
NVIDIA’s Compute Unified Device Architecture (CUDA) is a relatively-recent development that allows to realize very fast algorithms for several Constraint Satisfaction and Computer Aided Design tasks. In this paper we present an approach to use Graphics Processing Units (GPU) and CUDA for solving Unate Covering Problem, a practical problem related to SAT. In particular we present a CUDA-enabled ...
متن کاملImplementing Survey Propagation on Graphics Processing Units
We show how to exploit the raw power of current graphics processing units (GPUs) to obtain implementations of SAT solving algorithms that surpass the performance of CPU-based algorithms. We have developed a GPU-based version of the survey propagation algorithm, an incomplete method capable of solving hard instances of random k-CNF problems close to the critical threshold with millions of propos...
متن کامل