Reconfigurable hardware SAT solvers: A survey of systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2778, Issue , 2003, Pages 468-477

  Skliarova, Iouliia ^a   Ferrari, António B ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATION THEORY; COMPUTER HARDWARE; EMBEDDED SYSTEMS; GENERAL PURPOSE COMPUTERS; HARDWARE; LOGIC DEVICES; OPTIMIZATION;

BOOLEAN SATISFIABILITY; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL SYSTEM; GENERAL PURPOSE PROCESSORS; PROGRAMMABLE LOGIC DEVICE; PROGRAMMING MODELS; RECONFIGURABLE SYSTEMS; RESEARCH EFFORTS;

RECONFIGURABLE HARDWARE;

EID: 35248848429     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45234-8_46     Document Type: Review

References (25)

1. Estrin, G.: Reconfigurable Computer Origins: The UCLA Fixed-Plus-Variable (F+V) Structure Computer. IEEE Annals of the History of Computing. Oct.-Dec. (2002) 3-9
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 (1997) 19-151
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company. San Francisco (1979)
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 (1996) 497-509
5. Suyama, T., Yokoo, M., Sawada, H., Nagoya, A.: Solving Satisfiability Problems Using Reconfigurable Computing. IEEE Trans. on VLSI Systems, vol. 9, no. 1 (2001) 109-116
6. Freeman, J.W.: Improvements to Prepositional Satisfiability Search Algorithms. Ph.D. dissertation. Univ. Pennsylvania (1995)
7. DIMACS challenge benchmarks. [Online]. Available: http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/benchm.html
8. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM n. 5 (1962) 394-397
9. Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Using Configurable Computing to Accelerate Boolean Satisfiability. IEEE Trans. CAD of Integrated Circuits and Systems, vol. 18, n. 6 (1999) 861-868
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. (1998) 194-199
11. Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Solving Boolean satisfiability with dynamic hardware configurations. In Hartenstein, R.W., Keevallik, A. (eds). Field-Programmable Logic: From FPGAs to Computing Paradigm (1998). Springer-Verlag. 326-235
12. Zhong, P.: Using Configurable Computing to Accelerate Boolean Satisfiability. Ph.D. dissertation. Department of Electrical Engineering. Princeton University (1999)
13. Silva, L.M., Sakallah, K.A.: GRASP: a search algorithm for prepositional satisfiability. IEEE Trans. Computers, vol. 48, n. 5 (1999) 506-521
14. th. Int. Workshop on Field-Programmable Logic and Applications (1997), 448-456
15. Abramovici, M., de Sousa, J.T.: A SAT solver using reconfigurable hardware and virtual logic. Journal of Automated Reasoning, vol. 24, n. 1-2 (2000) 5-36
16. Platzner, M.: Reconfigurable accelerators for combinatorial problems. IEEE Computer. Apr. (2000) 58-60
17. Platzner, M., De Micheli, G.: Acceleration of satisfiability algorithms by reconfigurable hardware. In: Hartenstein, R.W., Keevallik, A. (eds.) Field-Programmable Logic: From FPGAs to Computing Paradigm. Springer-Verlag (1998) 69-78
18. th IEEE Int. Symp. on Field-Programmable Custom Computing Machines - FCCM (2000)
19. th IEEE Int. Symp. on Field-Programmable Custom Computing Machines (2001)
20. th IEEE Int. Symp. Field-Programmable Custom Computing Machines (2002) 282-283
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 (2002) 1094
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 (2002) 270-277
23. Simon, L., Le Berre, D., Hirsch, E.: The SAT2002 Competition. Technical Report (preliminary draft) [Online]. Available: http://www.satlive.org/SATCompetition/ onlinereport.pdf (2002)
24. th Design Automation Conference (2001) 530-535
25. Goldberg, E., Novikov, Y.: BerkMin: a Fast and Robust SAT-solver. In: Proc. Design, Automation and Test in Europe Conference (2002) 142-149