GpuShareSat: a SAT solver using the GPU for clause sharing

12/05/2020
by   Nicolas Prevot, et al.
0

We describe a SAT solver using both the GPU (CUDA) and the CPU with a new clause exchange strategy. The CPU runs a classic multithreaded CDCL SAT solver. EachCPU thread exports all the clauses it learns to the GPU. The GPU makes a heavy usage of bitwise operations. It notices when a clause would have been used by a CPU thread and notifies that thread, in which case it imports that clause. This relies on the GPU repeatedly testing millions of clauses against hundreds of assignments. All the clauses are tested independantly from each other (which allows the GPU massively parallel approach), but against all the assignments at once, using bitwise operations. This allows CPU threads to only import clauses which would have been useful for them. Our solver is based upon glucose-syrup. Experiments show that this leads to a strong performance improvement, with 22 more instances solved on the SAT 2020 competition than glucose-syrup.

READ FULL TEXT
research
05/29/2023

CPU-GPU Heterogeneous Code Acceleration of a Finite Volume Computational Fluid Dynamics Solver

This work deals with the CPU-GPU heterogeneous code acceleration of a fi...
research
07/27/2022

Scalable Proof Producing Multi-Threaded SAT Solving with Gimsatul through Sharing instead of Copying Clauses

We give a first account of our new parallel SAT solver Gimsatul. Its key...
research
04/13/2016

HordeQBF: A Modular and Massively Parallel QBF Solver

The recently developed massively parallel satisfiability (SAT) solver Ho...
research
08/29/2023

Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs

Although state-of-the-art (SOTA) SAT solvers based on conflict-driven cl...
research
10/30/2018

Efficient Tree Solver for Hines Matrices on the GPU

The human brain consists of a large number of interconnected neurons com...
research
11/26/2019

Summarizing CPU and GPU Design Trends with Product Data

Moore's Law and Dennard Scaling have guided the semiconductor industry f...
research
06/18/2019

Subsumption-driven clause learning with DPLL+restarts

We propose to use a DPLL+restart to solve SAT instances by successive si...

Please sign up or login with your details

Forgot password? Click here to reset