Reconfigurable Hardware SAT Solvers: A Survey of Systems

  • Iouliia Skliarova
  • António B. Ferrari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2778)


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.


Problem Instance Reconfigurable System Host Processor Conflict Analysis Reconfigurable Hardware 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Estrin, G.: Reconfigurable Computer Origins: The UCLA Fixed-Plus-Variable (F+V) Structure Computer. IEEE Annals of the History of Computing, 3–9 (October-December 2002)Google Scholar
  2. 2.
    Gu, J., Purdom, P.W., Franco, J., Wah, B.W.: Algorithms for the Satisfiability (SAT) Problem: A Survey. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, pp. 19–151 (1997)Google Scholar
  3. 3.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman and Company, San Francisco (1979)zbMATHGoogle Scholar
  4. 4.
    Yokoo, M., Suyama, T., Sawada, H.: Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results. In: Proc. of 2nd Int. Conf. on Principles and Practice of Constraint Programming, pp. 497–509 (1996)Google Scholar
  5. 5.
    Suyama, T., Yokoo, M., Sawada, H., Nagoya, A.: Solving Satisfiability Problems Using Reconfigurable Computing. IEEE Trans. on VLSI Systems 9(1), 109–116 (2001)CrossRefGoogle Scholar
  6. 6.
    Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D. dissertation. Univ. Pennsylvania (1995)Google Scholar
  7. 7.
    DIMACS challenge benchmarks [online], Available:
  8. 8.
    Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM (5), 394–397 (1962)Google Scholar
  9. 9.
    Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Using Configurable Computing to Accelerate Boolean Satisfiability. IEEE Trans. CAD of Integrated Circuits and Systems 18(6), 861–868 (1999)CrossRefGoogle Scholar
  10. 10.
    Zhong, P., Ashar, P., Malik, S., Martonosi, M.: Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability. In: Proc. Design Automation Conf., pp. 194–199 (1998)Google Scholar
  11. 11.
    Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Solving Boolean satisfiability with dynamic hardware configurations. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol. 1482, pp. 326–335. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  12. 12.
    Zhong, P.: Using Configurable Computing to Accelerate Boolean Satisfiability. Ph.D. dissertation. Department of Electrical Engineering. Princeton University (1999)Google Scholar
  13. 13.
    Silva, L.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Computers, vol. 48(5), 506–521 (1999)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Abramovici, M., Saab, D.: Satisfiability on Reconfigurable Hardware. In: Proc. 7th Int. Workshop on Field-Programmable Logic and Applications, pp. 448–456 (1997)Google Scholar
  15. 15.
    Abramovici, M., de Sousa, J.T.: A SAT solver using reconfigurable hardware and virtual logic. Journal of Automated Reasoning 24(1-2), 5–36 (2000)CrossRefGoogle Scholar
  16. 16.
    Platzner, M.: Reconfigurable accelerators for combinatorial problems. IEEE Computer, 58–60 (April 2000)Google Scholar
  17. 17.
    Platzner, M., De Micheli, G.: Acceleration of satisfiability algorithms by reconfigurable hardware. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol. 1482, pp. 69–78. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  18. 18.
    Boyd, M., Larrabee, T.: ELVIS – a scalable, loadable custom programmable logic device for solving Boolean satisfiability problems. In: Proc. 8th IEEE Int. Symp. on Field-Programmable Custom Computing Machines - FCCM (2000)Google Scholar
  19. 19.
    de Sousa, J., Marques-Silva, J.P., Abramovici, M.: A configware/software approach to SAT solving. In: Proc. of 9th IEEE Int. Symp. on Field-Programmable Custom Computing Machines (2001)Google Scholar
  20. 20.
    Reis, N.A., de Sousa, J.T.: On Implementing a Configware/Software SAT Solver. In: Proc. of 10th IEEE Int. Symp. Field-Programmable Custom Computing Machines, pp. 282–283 (2002)Google Scholar
  21. 21.
    Skliarova, I., Ferrari, A.B.: A SAT Solver Using Software and Reconfigurable Hardware. In: Proc. of the Design, Automation and Test in Europe Conference, p. 1094 (2002)Google Scholar
  22. 22.
    Skliarova, I., Ferrari, A.B.: A hardware/software approach to accelerate Boolean satisfiability. In: Proc. of IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop, pp. 270–277 (2002)Google Scholar
  23. 23.
    Simon, L., Le Berre, D., Hirsch, E.: The SAT 2002 Competition. Technical Report (2002) (preliminary draft) [Online]. Available:
  24. 24.
    Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of the 38th Design Automation Conference, pp. 530–535 (2001)Google Scholar
  25. 25.
    Goldberg, E., Novikov, Y.: BerkMin: a Fast and Robust SAT-solver. In: Proc. Design, Automation and Test in Europe Conference, pp.142–149 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Iouliia Skliarova
    • 1
  • António B. Ferrari
    • 1
  1. 1.Department of Electronics and TelecommunicationsUniversity of Aveiro, IEETAAveiroPortugal

Personalised recommendations