Accelerating Boolean Satissability with Conngurable Hardware

This paper describes and evaluates methods for implementing formula-speciic Boolean satissability (SAT) solver circuits in conngurable hardware. Starting from a general template design, our approach automatically generates VHDL for a circuit that is speciic to the particular Boolean formula being solved. Such an approach tightly customizes the circuit to a particular problem instance. Thus, it represents an ideal use for dynamically-reconngurable hardware, since it would be impractical to fabricate an ASIC for each Boolean formula being solved. Our approach also takes advantage of direct gate mappings and large degrees of ne-grained parallelism in the algorithm's Boolean logic evaluations. We compile our designs to two hardware targets: an IKOS logic emulation system, and Digital SRC's Pamette conngurable computing board. Performance evaluations on the DIMACS SAT benchmark suite indicate that our approach ooers speedups from 17X to more than a thousand times. Overall, this SAT solver demonstrates promising performance speedups on an important and complex problem with extensive applications in the CAD and AI communities.