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.

• Type: Conference
• Year: 2003
• Where: FPL
• Authors: Iouliia Skliarova, António de Brito Ferrari
• Keywords: FPL 2003, Hardware Sat Satisfiers, Reconfigurable Systems, Such Computational Systems