FPGA-based hardware acceleration for Boolean satisfiability

  • Authors:
  • Kanupriya Gulati;Suganth Paul;Sunil P. Khatri;Srinivas Patil;Abhijit Jas

  • Affiliations:
  • Texas A & M University;Intel, Inc.;Texas A & M University;Intel, Inc.;Intel, Inc.

  • Venue:
  • ACM Transactions on Design Automation of Electronic Systems (TODAES)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an FPGA-based hardware solution to the Boolean satisfiability (SAT) problem, with the main goals of scalability and speedup. In our approach the traversal of the implication graph as well as conflict clause generation are performed in hardware, in parallel. The experimental results and their analysis, along with the performance models are discussed. We show that an order of magnitude improvement in runtime can be obtained over MiniSAT (the best-in-class software based approach) by using a Virtex-4 (XC4VFX140) FPGA device. The resulting system can handle instances with as many as 10K variables and 280K clauses.