Reconfigurable Hardware SAT Solvers: A Survey of Systems

By adapting to computations that are not so well supported by general-purpose processors, reconfigurable systems achieve significant increases in performance. Such computational systems use high-capacity programmable logic devices and are based on processing units customized to the requirements of a particular application. A great deal of research effort in this area is aimed at accelerating the solution of combinatorial optimization problems. Special attention was given to the Boolean satisfiability (SAT) problem resulting in a considerable number of different architectures being proposed. This paper presents the state-of-the-art in reconfigurable hardware SAT satisfiers. The analysis of existing systems has been performed according to such criteria as reconfiguration modes, the execution model, the programming model, etc.

[1]  José T. de Sousa,et al.  On implementing a configware/software SAT solver , 2002, Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[2]  Sharad Malik,et al.  Solving Boolean Satisfiability with Dynamic Hardware Configurations , 1998, FPL.

[3]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[4]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[5]  Sharad Malik,et al.  Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability , 1998, Proceedings 1998 Design and Automation Conference. 35th DAC. (Cat. No.98CH36175).

[6]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7]  Marco Platzner.  Reconfigurable Accelerators for Combinatorial Problems , 2000, Computer.

[8]  M. Abramovici,et al.  A Configware/Software Approach to SAT Solving , 2001 .

[9]  Iouliia Skliarova,et al.  A SAT solver using software and reconfigurable hardware , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[10]  Makoto Yokoo,et al.  Solving satisfiability problems using reconfigurable computing , 2001, IEEE Trans. Very Large Scale Integr. Syst..

[11]  José T. de Sousa,et al.  A SAT Solver Using Reconfigurable Hardware and Virtual Logic , 2000, Journal of Automated Reasoning.

[12]  Makoto Yokoo,et al.  Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results , 1996, CP.

[13]  Tracy Larrabee,et al.  A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems , 2000, Proceedings 2000 IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00871).

[14]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[15]  Gerald Estrin,et al.  Reconfigurable Computer Origins: The UCLA Fixed-Plus-Variable (F+V) Structure Computer , 2002, IEEE Ann. Hist. Comput..

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Marco Platzner,et al.  Acceleration of Satisfiability Algorithms by Reconfigurable Hardware , 1998, FPL.

[18]  Sharad Malik,et al.  Using configurable computing to accelerate Boolean satisfiability , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Daniel G. Saab,et al.  Satisfiability on reconfigurable hardware , 1997, FPL.

[20]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[21]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.