A short overview on modern parallel SAT-solvers

ICACSIS 2011 - 2011 International Conference on Advanced Computer Science and Information Systems, Proceedings

Volumn , Issue , 2011, Pages 201-206

  Hölldobler, Steffen ^a   Manthey, Norbert ^a   Van Hau Nguyen, ^a   Stecklina, Julian ^a   Steinke, Peter ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MULTI-CORE PROCESSOR;

COMPUTER SCIENCE;

INFORMATION SYSTEMS;

EID: 84857269737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. Stephen A. Cook. The complexity of theorem-proving procedures. In Proc. STOC:151-158, 1971.
2. A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors. Handbook of Satisfiability. IOS Press, 2009.
3. Steffen Hölldobler, Norbert Manthey, and Ari Saptawijaya. Improving resource-unaware SAT solvers. In Proc. LPAR: 357-371, 2010.
4. M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem Proving. CACM, 5(7):394-397, 1962.
5. João P. Marques Silva and Karem A. Sakallah. GRASP: A New Search Algorithm for Satisfiability. In Proc. ICCAD: 220-227, 1996.
6. Lintao Zhang, Conor F. Madigan, and Matthew H. Moskewicz. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In Proc. ICCAD:279-285, 2001.
7. Antonio Ramos, Peter van der Tak, and Marijn Heule. Between Restarts and Backjumps. In Proc. SAT:216-229, 2011.
8. Niklas Sörensson. MiniSAT2.2 and MiniSAT++1.1. http:// baldur.iti.uka.de/sat-race-2010/descriptions/solver-25+26.pdf, 2010.
9. N. Eén and N. Sörensson. An Extensible SAT-solver. In Proc. SAT:502-518, 2004.
10. Daniel Singer. Parallel Resolution of the Satisfiability Problem: A Survey. Wiley Interscience, 2006.
11. Steffen Hölldobler et al. Modern Parallel SAT-Solvers, TR 2011-6, Knowledge Representation and Reasoning Group, TU Dresden, Germany, 2011.
12. Luís Gil, Paulo Flores, and Luís M. Silveira. PMSat: a parallel version of MiniSAT. JSAT, 6:71-98, 2008.
13. Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. A distribution method for solving SAT in grids. In In Proc. SAT:430-435, 2006.
14. Antti E. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Strategies for Solving SAT in Grids by Randomized Search. In Proc. AISC/MKM/Calculemus:125-140, 2008.
15. Antti E. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Incorporating Learning in Grid-Based Randomized SAT Solving. In Proc. AIMSA:247-261, 2008.
16. Kei Ohmura and Kazunori Ueda. c-sat: A Parallel SAT Solver for Clusters. In Proc. SAT:524-537, 2009.
17. Matthew W. Moskewicz et al. Chaff: Engineering an Efficient SAT Solver. In Proc. DAC:530-535, 2001.
18. Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Partitioning SAT instances for distributed solving. In Proc. LPAR:372-386, 2010.
19. Antti E. J. Hyvärinen, Tommi Junttila, and Ilkka Niemelä. Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. In Proc. CP:385-399, 2011.
20. Wolfgang Blochinger, Carsten Sinz, and Wolfgang Kuchlin. A Universal Parallel SAT Checking Kernel. In Proc. PDPTA:1720-1725, 2003.
21. Yulik Feldman, Nachum Dershowitz, and Ziyad Hanna. Parallel Multithreaded Satisfiability Solver: Design and Implementation. In Proc. PDMC:75-90, 2005.
22. Matthew D. T. Lewis, Tobias Schubert, and Bernd Becker. Multithreaded SAT Solving. In Proc. ASP-DAC:926-931, 2007.
23. T. Schubert, M. Lewis, and B. Becker. PaMiraXT: Parallel SAT solving with threads and message passing. JSAT 6:203-222, 2009.
24. Ruben Martins, Vasco Manquinho, and Ines Lynce. Improving Search Space Splitting for Parallel SAT Solving. In Proc. ICTAI:336-343, 2010.
25. Daniel Le Berre. Sat4j: a reasoning engine in Java based on the SATisfiability problem (SAT). http://www.sat4j.org.
26. Marijn J.H. Heule et al. Cube and conquer: Guiding CDCL SAT solvers by lookaheads, 2011. Accepted for HVC 2011.
27. Youssef Hamadi, Saïd Jabbour, and Lakhdar Sais. ManySAT: a Parallel SAT Solver. JSAT 6:245-262, 2009.
28. Long Guo et al. Diversification and intensification in parallel SAT solving. In Proc CP:252-265, 2010.
29. Youssef Hamadi et al. Deterministic Parallel DPLL: System Description. In Pragmatics of SAT, 2011. To appear.
30. Stephan Kottler and Michael Kaufmann. SArTagnan - A parallel portfolio SAT solver with lockless physical clause sharing. In Pragmatics of SAT, 2011. To appear.
31. John L. Hennessy and David A. Patterson. Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 2007.
32. P. Conway and B. Hughes. The AMD Opteron Northbridge Architecture. Micro, IEEE, 27(2):10-21, 2007. (Pubitemid 47322497)
33. D. Ziakas et al. Intel QuickPath Interconnect Architectural Features Supporting Scalable System Architectures. In Proc. HOTI:1-6, 2010.
34. S. Boyd-Wickizer et al. Corey: an operating system for many cores. In Proc. OSDI:43-57, 2008.
35. K. Asanovic et al. The Landscape of Parallel Computing Research: A View from Berkeley. Technical Report UCB/EECS- 2006-183, U. of California, Berkeley, 2006.
36. S.R. Vangal et al. An 80-Tile Sub-100-W TeraFLOPS Processor in 65-nm CMOS. IEEE Journal of Solid-State Circuits, 43(1):29-41, 2008.
37. Intel. SCC External Architecture Specification, 2010.
38. Tilera. TILE-Gx 3000 Series Overview, 2011.