A Collaborative Approach for Multi-Threaded SAT Solving

International Journal of Parallel Programming

Volumn 37, Issue 3, 2009, Pages 324-342

  Vander Swalmen, Pascal ^a   Dequen, Gilles ^b   Krajecki, Michaël ^a  

^a UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^b UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

Dll; OpenMP; Parallel combinatorial optimization; Satisfiability

Indexed keywords

COLLABORATIVE APPROACH; DLL; FINE GRAINED; FINE GRAINS; MULTI-CORE PROCESSOR; MULTITHREADED; OPENMP; PARALLEL COMBINATORIAL OPTIMIZATION; SAT INSTANCES; SAT PROBLEMS; SAT SOLVERS; SAT-SOLVING; SATISFIABILITY; SATISFIABILITY PROBLEMS; SHARED MEMORIES;

COMBINATORIAL OPTIMIZATION;

MESSAGE PASSING;

EID: 67349149621     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10766-009-0097-6     Document Type: Article

References (24)

1. Cook, S.A.: The complexity of theorem proving procedures. In: 3rd ACM Symposium on Theory of Computing, pp. 151-158. Ohio (1971)
2. A. Braunstein M. Mézard R. Zecchina 2005 Survey propagation: an algorithm for satisfiability Random Struct. Algorithms 27 2 201 226 (Pubitemid 41482546)
3. Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic and stochastic search. In: Proceedings of the 30th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, pp. 1194-1201. AAAI Press / MIT Press, Menlo Park, 4-8 August 1996
4. Biere, A., Heljanko, K., Junttila, T., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Logic. Method Computer Sci. 2, (2006)
5. N.R. Potlapally A. Raghunathan S. Ravi N.K. Jha R.B. Lee 2007 Aiding side-channel attacks on cryptographic software with satisfiability-based analysis IEEE Trans. VLSI Syst. 15 4 465 470 (Pubitemid 46685683)
6. M. Davis G. Logemann D. Loveland 1962 A machine program for theorem-proving J. Assoc. Comput. Mach. 5 394 397
7. Bacchus, F., Winter, J.: Effective preprocessing with hyper-resolution and equality reduction. (Online). Available: citeseer.ist.psu.edu/ bacchus03effective.html (2003)
8. Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: Proceedings of ICCAD, San Jose, Nov 2001
9. Habbas, Z., Krajecki, M., Singer, D.: Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study. Intern. J. Comput. Sci. Eng. (IJCSE). 1(2/3/4):192-206, inderscience Publishers, ISSN : 1742-7185 (2005)
10. Vander-Swalmen, P., Dequen, G., Krajecki, M.: On multi-threaded satisfiability solving with openmp. In: IWOMP, pp. 146-157 (2008)
11. Hoos, .H., Stützle, T.: Stochastic local search : foundations and applications (The Morgan Kaufmann Series in Artificial Intelligence). Morgan Kaufmann, September 2004
12. G. Dequen O. Dubois 2006 An efficient approach to solving random-satproblems J. Autom. Reasoning. 37 4 261 276
13. H. Zhang M.P. Bonacina J. Hsiang 1996 Psato: a distributed propositional prover and its application to quasigroup problems J. Symb. Comput. 21 4-6 543 560 (Pubitemid 126159673)
14. Jurkowiak, B., Li, C.M., Utard, G.: Parallelizing Satz using dynamic workload balancing. In: Proceedings of Workshop on Theory and Application of Satisfiability Testing (Sat'2001), pp. 205-211. Boston, June 2001
15. Mitchell, D., Selman, B., Levesque, H.J.: Hard and easy distribution of SAT problems. In: Proceedings of 10th National Conference on Artificial Intelligence, pp. 459-465. AAAI (1992) (Pubitemid 23633548)
16. W. Chrabakh R. Wolski 2006 Gridsat: design and implementation of a computational grid application J. Grid Comput. 4 2 177 193
17. Singer, D., Monnet, A.: JaCk-SAT: A new parallel scheme to solve the satisfiability problem (SAT) based on join-and-check. In: Proceedings of Parallel Processing and Applied Mathematics, Gdansk, (2007)
18. Feldman, Y., Dershowitz, N., Hanna, Z.: Parallel multithreaded satisfiability solver: design and implementation (2004)
19. Lewis, M., Schubert, T., Becker, B.: Multithreaded sat solving. In: ASP-DAC '07: Proceedings of the 2007 Conference on Asia South Pacific Design Automation, pp. 926-931. Washington, DC, USA: IEEE Computer Society (2007)
20. Silva, J.P.M., Sakallah, K.A.: Grasp a new search algorithm for satisfiability. In: ICCAD '96: Proceedings of the 1996 IEEE/ACM International Conference on Computer-aided design, pp. 220-227. Washington, DC, USA: IEEE Computer Society (1996)
21. Chu, G., Stuckey, P.J.: Pminisat: a parallelization of minisat 2.0. Tech. Rep. (Online). Available: http://www-sr.informatik.uni-tuebingen.de/sat-race- 2008/descriptions/solver-32.pdf (2008)
22. Hamadi, Y., Jabbour, S., Sais, L.: Manysat a multicore sat solver (first rank at the sat race 2008 competition). Tech. Rep. (Online). Available: http://www-sr.informatik.uni-tuebingen.de/sat-race-2008/descriptions/solver-24. pdf (2008)
23. Wand, Y.T., Morris, R.J.: Load sharing in distributed systems. IEEE Trans. Computers 202-217 (1985)
24. Jaillet, C., Krajecki, M.: Parallel programming with openmp: a new memory allocation model avoiding cache faults. In: International Workshop on OpenMP 2007 (IWOMP2007). Tsinghua University, Beijing, China, jun 2007, short paper