Abstract
In this chapter we present a Boolean satisfiability solver with a new GPU-enhanced variable ordering heuristic. Our approach is implemented in a CPU-based procedure and leverages the parallelism of a graphics processing unit (GPU). The CPU implements a complete procedure (MiniSAT), while the GPU implements an approximate procedure (an implementation of survey propagation – SurveySAT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
http://www.cs.chalmers.se/cs/research/formalmethods/minisat/main.html. The MiniSAT Page
http://www.cs.rochester.edu/u/kautz/papers/gsat. GSAT-USERS-GUIDE
http://www.cs.rochester.edu/u/kautz/walksat. WalkSAT homepage
http://www.satcompetition.org/. The International SAT Competitions Web Page
NVIDIA CUDA Homepage. http://developer.nvidia.com/object/cuda.html
Bohm, M., Speckenmeyer, E.: A fast parallel SAT-solver – Efficient workload balancing. In: Annals of Mathematics and Artificial Intelligence, pp. 40–0 (1996)
Braunstein, A., Mezard, M., Zecchin, R.: Survey propagation: An algorithm for satisfiability. Random Structures and Algorithms 27, 201–226 (2005)
Chavas, J., Furtlehner, C., Mezard, M., Zecchina, R.: Survey-propagation decimation through distributed local computations. Journal of Statistical Mechanics (11), 11016 (2005)
Chrabakh, W., Wolski, R.: GridSAT: A Chaff-based distributed SAT solver for the grid. In: SC ’03: Proceedings of the 2003 ACM/IEEE Conference on Supercomputing, p. 37. IEEE Computer Society, Washington, DC (2003)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communication of the ACM 5(7), 394–397 (1962)
Fang, L., Hsiao, M.S.: A new hybrid solution to boost SAT solver performance. In: DATE ’07: Proceedings of the Conference on Design, Automation and Test in Europe, pp. 1307–1313. EDA Consortium, San Jose, CA (2007)
Feldman, Y.: Parallel multithreaded satisfiability solver: Design and implementation (2005)
Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT solver. In: Proceedings, Design, Automation and Test in Europe (DATE) Conference, pp. 142–149 (2002)
Jin, H., Awedh, M., Somenzi, F.: CirCUs: A satisfiability solver geared towards bounded model checking. In: Computer Aided Verification, pp. 519–522 (2004)
Jurkowiak, B., Li, C.M., Utard, G.: A parallelization scheme based on work stealing for a class of SAT solvers. J. Autom. Reason. 34(1), 73–101 (2005)
Maneva, E., Mossel, E., Wainwright, M.J.: A new look at survey propagation and its generalizations. In: SODA ’05: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1089–1098. Society for Industrial and Applied Mathematics, Philadelphia, PA (2005)
Manolis, P., Zhang, Y.: Implementing survey propagation on graphics processing units. In: SAT ’06: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, pp. 311–324 (2006)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the Design Automation Conference, pp. 530–535 (2001)
Shang, Y.: A discrete Lagrangian-based global-search method for solving satisfiability problems. Journal of Global Optimization 12, 61–99 (1998)
Silva, M., Sakallah, J.: GRASP-a new search algorithm for satisfiability. In: Proceedings of the International Conference on Computer-Aided Design (ICCAD), pp. 220–7 (1996)
Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: A distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation 21(4-6), 543–560 (1996)
Zheng, L., Stuckey, P.J.: Improving SAT using 2SAT. In: ACSC ’02: Proceedings of the Twenty-fifth Australasian Conference on Computer Science, pp. 331–340. Australian Computer Society, Inc., Darlinghurst, Australia (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Gulati, K., Khatri, S.P. (2010). Accelerating Boolean Satisfiability on a Graphics Processing Unit. In: Hardware Acceleration of EDA Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0944-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0944-2_6
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0943-5
Online ISBN: 978-1-4419-0944-2
eBook Packages: EngineeringEngineering (R0)