poster

Boolean satisfiability on a graphics processor

Authors:

Kanupriya Gulati,

Sunil P. KhatriAuthors Info & Claims

GLSVLSI '10: Proceedings of the 20th symposium on Great lakes symposium on VLSI

Pages 123 - 126

https://doi.org/10.1145/1785481.1785511

Published: 16 May 2010 Publication History

Abstract

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.

References

[1]

S. Cook, "The complexity of theorem-proving procedures," in Proceedings, Third ACM Symp. Theory of Computing, 1971, pp. 151--158.

Digital Library

[2]

M. Silva and J. Sakallah, "GRASP-a new search algorithm for satisfiability," in Proceedings of the International Conference on Computer-Aided Design (ICCAD), November 1996, pp. 220--7.

Digital Library

[3]

M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proceedings of the Design Automation Conference, July 2001.

Digital Library

[4]

"http://www.cs.chalmers.se/cs/research/formalmethods/minisat/main.html," the MiniSAT Page.

[5]

"http://www.cs.rochester.edu/u/kautz/walksat," Walksat homepage.

[6]

"http://www.cs.rochester.edu/u/kautz/papers/gsat," GSAT-users-guide.

[7]

A. Braunstein, M. Mezard, and R. Zecchin, "Survey propagation: an algorithm for satisfiability," Random Structures and Algorithms, vol. 27, pp. 201--226, 2005.

Digital Library

[8]

J. Chavas, C. Furtlehner, M. Mezard, and R. Zecchina, "Survey-propagation decimation through distributed local computations," J. Stat. Mech, p. P11016, 2005.

[9]

Z. Fan, F. Qiu, A. Kaufman, and S. Yoakum-Stover, "GPU cluster for high performance computing," in SC '04: Proceedings of the 2004 ACM/IEEE conference on Supercomputing. Washington, DC, USA: IEEE Computer Society, 2004, p. 47.

Digital Library

[10]

J. Owens, "GPU architecture overview," in SIGGRAPH '07: ACM SIGGRAPH 2007 courses. New York, NY, USA: ACM, 2007, p. 2.

Digital Library

[11]

M. Pharr and R. Fernando, GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation (Gpu Gems). Addison-Wesley Professional, 2005.

Digital Library

[12]

L. Fang and M. S. Hsiao, "A new hybrid solution to boost SAT solver performance," in DATE '07: Proceedings of the conference on Design, automation and test in Europe. San Jose, CA, USA: EDA Consortium, 2007, pp. 1307--1313.

Digital Library

[13]

L. Zheng and P. J. Stuckey, "Improving SAT using 2SAT," in ACSC '02: Proceedings of the twenty-fifth Australasian conference on Computer science. Darlinghurst, Australia, Australia: Australian Computer Society, Inc., 2002, pp. 331--340.

Digital Library

[14]

"http://baldur.iti.uka.de/sat-race-2008," SAT-Race 2008.

[15]

E. Maneva, E. Mossel, and M. J. Wainwright, "A new look at survey propagation and its generalizations," in SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 2005, pp. 1089--1098.

Digital Library

[16]

P. Manolis and Y. Zhang, "Implementing survey propagation on graphics processing units," in SAT '06: Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2006, pp. 311--324.

Digital Library

[17]

"NVIDIA CUDA Homepage," http://developer.nvidia.com/object/cuda.html.

Cited By

IIZUKA YKoshiba H(2019)Massive Parallel Max-SAT Solver Based on Speculative Computation2019 8th International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAI-AAI.2019.00241(1093-1094)Online publication date: Jul-2019
https://doi.org/10.1109/IIAI-AAI.2019.00241
Gong WZhou X(2017)A survey of SAT solver10.1063/1.4981999(020059)Online publication date: 2017
https://doi.org/10.1063/1.4981999
Stewart SRayside DGanesh VCzarnecki K(2016)Accelerating the General Simplex Procedure for Linear Real Arithmetic via GPUsVerified Software. Theories, Tools, and Experiments10.1007/978-3-319-48869-1_10(129-138)Online publication date: 8-Nov-2016
https://doi.org/10.1007/978-3-319-48869-1_10
Show More Cited By

Index Terms

Boolean satisfiability on a graphics processor
1. Hardware
  1. Hardware validation
    1. Functional verification

Recommendations

Boolean satisfiability with transitivity constraints

We consider a variant of the Boolean satisfiability problem where a subset ε of the propositional variables appearing in formula F_sat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables, e_i,j, for 1 ≤ i < ...
A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiability

We present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSAT_CNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...
Accelerating Boolean Satisfiability (SAT) solving by common subclause elimination

Boolean Satisfiability (SAT) is an important problem in many domains. Modern SAT solvers have been widely used in important industrial applications including automated planning and verification. To solve more problems in real applications, new ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

GLSVLSI '10: Proceedings of the 20th symposium on Great lakes symposium on VLSI

May 2010

502 pages

ISBN:9781450300124

DOI:10.1145/1785481

General Chairs:
R. Iris Bahar
Brown University, USA
,
Fabrizio Lombardi
Northeastern University, USA
,
Program Chairs:
David Atienza
EPFL, Switzerland
,
Erik Brunvand
University of Utah, USA

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

In-Cooperation

IEEE CEDA
IEEE CASS

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

GLSVLSI '10

Sponsor:

SIGDA

GLSVLSI '10: Great Lakes Symposium on VLSI 2010

May 16 - 18, 2010

Rhode Island, Providence, USA

Acceptance Rates

Overall Acceptance Rate 312 of 1,156 submissions, 27%

Upcoming Conference

GLSVLSI '25

Sponsor:
sigda

Great Lakes Symposium on VLSI 2025

June 30 - July 2, 2025

New Orleans , LA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
357
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)2

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

IIZUKA YKoshiba H(2019)Massive Parallel Max-SAT Solver Based on Speculative Computation2019 8th International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAI-AAI.2019.00241(1093-1094)Online publication date: Jul-2019
https://doi.org/10.1109/IIAI-AAI.2019.00241
Gong WZhou X(2017)A survey of SAT solver10.1063/1.4981999(020059)Online publication date: 2017
https://doi.org/10.1063/1.4981999
Stewart SRayside DGanesh VCzarnecki K(2016)Accelerating the General Simplex Procedure for Linear Real Arithmetic via GPUsVerified Software. Theories, Tools, and Experiments10.1007/978-3-319-48869-1_10(129-138)Online publication date: 8-Nov-2016
https://doi.org/10.1007/978-3-319-48869-1_10
Iturriaga SNesmachnow SLuna FAlba E(2015)A parallel local search in CPU/GPU for scheduling independent tasks on large heterogeneous computing systemsThe Journal of Supercomputing10.1007/s11227-014-1315-671:2(648-672)Online publication date: 1-Feb-2015
https://dl.acm.org/doi/10.1007/s11227-014-1315-6
Velev MGao P(2014)Efficient parallel GPU algorithms for BDD manipulation2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)10.1109/ASPDAC.2014.6742980(750-755)Online publication date: Jan-2014
https://doi.org/10.1109/ASPDAC.2014.6742980
Dal Palù ADovier AFormisano APontelli E(2014)CUD@SAT: SAT solving on GPUsJournal of Experimental & Theoretical Artificial Intelligence10.1080/0952813X.2014.95427427:3(293-316)Online publication date: 5-Sep-2014
https://doi.org/10.1080/0952813X.2014.954274
Campeotto FPalù ADovier AFioretto FPontelli E(2014)Exploring the Use of GPUs in Constraint SolvingProceedings of the 16th International Symposium on Practical Aspects of Declarative Languages - Volume 832410.1007/978-3-319-04132-2_11(152-167)Online publication date: 20-Jan-2014
https://dl.acm.org/doi/10.1007/978-3-319-04132-2_11

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten