GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
GPU Cluster for High Performance Computing
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems)
A new look at survey propagation and its generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Survey propagation: An algorithm for satisfiability
Random Structures & Algorithms
A new hybrid solution to boost SAT solver performance
Proceedings of the conference on Design, automation and test in Europe
ACM SIGGRAPH 2007 courses
Implementing survey propagation on graphics processing units
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Boolean Satisfiability (SAT) is a core NP-complete problem. Several heuristic software and hardware approaches have been proposed to solve this problem. In this paper we present a Boolean satisfiablity approach with a new GPU-enhanced variable ordering heuristic. Our results demonstrate that over several satisfiable and unsatisfiable benchmarks, our technique (MESP) performs better than MiniSAT. We show a 2.35× speedup on average, over 68 from the SAT Race (2008) competition.