Abstract
We present different architectures to solve Boolean satisfiability problems in instance-specific hardware. A simulation of these architectures shows that for examples from the DIMACS benchmark suite, high raw speed-ups over software can be achieved. We present a design tool flow and prototype implementation of an instance-specific satisfiability solver and discuss experimental results. We measure the overall speed-up of the instance-specific architecture that takes the hardware compilation time into account. The results prove that many of the DIMACS examples can be accelerated with current FPGA technology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jun Gu, Paul W. Purdom, John Franco, and Benjamin W. Wah. Algorithms for the Satisfiability (SAT) Problem: A Survey. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 35:19–151, 1997.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, (7):201–215, 1960.
M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, (5):394–397, 1962.
J. Silva and K. Sakallah. GRASP — A New Search Algorithm for Satisfiability. In IEEE ACM International Conference on CAD '96, pages 220–227, November 1996.
Peixin Zhong, Margaret Martonosi, Sharad Malik, and Pranav Ashar. Implementing Boolean Satisfiability in Configurable Hardware. In Logic Synthesis Workshop, May 1997.
Peixin Zhong, Margaret Martonosi, Pranav Ashar, and Sharad Malik. Accelerating Boolean Satisfiability with Configurable Hardware. In IEEE Symposium on FPGAs for Custom Computing Machines, April 1998.
DIMACS satsifiability benchmark suite, available at ftp://dimacs.rutgers.edu/pub/challenge/sat/benchmarks/cnf/.
Takayuki Suyama, Makoto Yokoo, and Hiroshi Sawada. Solving Satisfiability Problems on FPGAs. In International Workshop on Field-Programmable Logic and Applications (FPL), pages 136–145, 1996.
Miron Abramovici and Daniel Saab. Satisfiablity on Reconfigurable Hardware. In International Workshop on Field-Programmable Logic and Applications (FPL), pages 448–456, 1997.
Azra Rashid, Jason Leonard, and William H. Mangione-Smith. Dynamic Circuit Generation for Solving Specific Problem Instances of Boolean Satisfiablity. In IEEE Symposium on FPGAs for Custom Computing Machines, April 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Platzner, M., De Micheli, G. (1998). Acceleration of satisfiability algorithms by reconfigurable hardware. In: Hartenstein, R.W., Keevallik, A. (eds) Field-Programmable Logic and Applications From FPGAs to Computing Paradigm. FPL 1998. Lecture Notes in Computer Science, vol 1482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055234
Download citation
DOI: https://doi.org/10.1007/BFb0055234
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64948-9
Online ISBN: 978-3-540-68066-6
eBook Packages: Springer Book Archive