Reconfigurable models of finite state machines and their implementation in FPGAs
Journal of Systems Architecture: the EUROMICRO Journal
Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Reconfigurable systems
Reconfigurable Hardware SAT Solvers: A Survey of Systems
IEEE Transactions on Computers
A software/reconfigurable hardware SAT solver
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A fast SAT solver algorithm best suited to reconfigurable hardware
SBCCI '06 Proceedings of the 19th annual symposium on Integrated circuits and systems design
Synthesis of FSMs on the basis of reusable hardware templates
ISTASC'06 Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Designing an efficient hardware implication accelerator for SAT solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Relieving capacity limits on FPGA-based SAT-solvers
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
| Hi-index | 0.00 |
This paper presents the first configware/software solution for the Boolean satisfiability problem (SAT). Our partitioning assigns the two most difficult tasks (computing implications and selecting the next decision variable) for configurable hardware (configware) implementation. Conflict diagnosis, backtrack control, and clause database management are performed in software. Our approach avoids instance-specific place and route, and features a virtual hardware scheme with context switching which allows solving problems that are larger than the configware capacity. Some preliminary results show the feasibility of the approach.