Parallel propositional satisfiability checking with distributed dynamic learning

Parallel Computing

Volumn 29, Issue 7, 2003, Pages 969-994

  Blochinger, Wolfgang ^a   Sinz, Carsten ^a   Küchlin, Wolfgang ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Distributed multithreading; Parallel propositional satisfiability checking; Parallel symbolic computation

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS; OBJECT ORIENTED PROGRAMMING; PARALLEL PROCESSING SYSTEMS;

MULTITHREADING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0038684546     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00068-1     Document Type: Article

References (36)

1. Antoniu G., Bougé L. DSM-PM2: a portable implementation platform for multithreaded dsm consistency protocols. Proceedings of 6th International Workshop on High-Level Parallel Programming Models and Supportive Environments (HIPS '01) San Francisco. Lecture Notes in Computer Science. vol. 2026:2001;55-70 Springer-Verlag.
2. Bal H.E., Steiner J.G., Tanenbaum A.S. Programming languages for distributed computing systems. ACM Computing Surveys. 21(3):1989;261-322.
3. Biere A., Cimatti A., Clarke E., Zhu Y. Symbolic model checking without BDDs. Tools and Algorithms for the Analysis and Construction of Systems (TACAS'99). Lecture Notes in Computer Science. vol. 1579:1999;Springer-Verlag.
4. Blochinger W. Distributed high performance computing in heterogeneous environments with DOTS. Proceedings of International Parallel and Distributed Processing Symposium (10th Heterogeneous Computing Workshop) San Francisco, CA, USA. 2001;90 IEEE Computer Society Press.
5. Blochinger W., Bündgen R., Heinemann A. Dependable high performance computing on a Parallel Sysplex cluster. Arabnia H.R. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000) Las Vegas, NV, USA, vol. 3. 2000;1627-1633 CSREA Press.
6. Blochinger W., Küchlin W., Ludwig C., Weber A. An object-oriented platform for distributed high-performance symbolic computation. Mathematics and Computers in Simulation. 49:1999;161-178.
7. R.D. Blumofe, C.E. Leiserson, Scheduling multithreaded computations by work stealing, in: 35th Annual Symposium on Foundations of Computer Science (FOCS '94) Mexico, November 1994, pp. 356-368.
8. Boehm M., Speckenmeyer E. A fast parallel SAT-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence. 17(3-4):1996;381-400.
9. Briat J., Ginzburg I., Pasin M., Plateau B. Athapascan runtime: efficiency for irregular problems. Proceedings of the Europar'97 Conference, Passau, Germany. 1997;590-599 Springer-Verlag.
10. Brüngger A., Marzetta A., Clausen J., Perregaard M. Solving large-scale QAP problems in parallel with the search library ZRAM. Journal of Parallel and Distributed Computing. 50(1):1998;157-169.
11. Bubeck T., Hiller M., Küchlin W., Rosenstiel W. Distributed symbolic computation with DTS. Ferreira A., Rolim J. Parallel Algorithms for Irregularly Structured Problems, IRREGULAR'95 Lyon, France. Lecture Notes in Computer Science. vol. 980:1995;231-248 Springer-Verlag.
12. Cook S.A. The complexity of theorem proving procedures. 3rd Symposium on Theory of Computing. 1971;151-158 ACM press.
13. Davis M., Logemann G., Loveland D. A machine program for theorem-proving. Communications of the ACM. 5(7):1962;394-397.
14. Davis M., Putnam H. A computing procedure for quantification theory. Journal of the ACM. 7(3):1960;201-215.
15. Decker T. Virtual data space - load balancing for irregular applications. Parallel Computing. 26:2000;1825-1860.
16. Distributed Cilk. Available from 〈http://supertech.lcs.mit.edu/cilk/home/distcilk5.1.html〉.
17. Foster I., Kesselman C., Tuecke S. The nexus approach to integrating multithreading and communication. Journal of Parallel and Distributed Computing. 37:1996;70-82.
18. Friedman R., Goldin M., Itzkovitz A., Schuster A. Millipede: easy parallel programming in available distributed environment. Software: Practice and Experience. 27(8):1997;929-965.
19. Fujita M., Slaney J., Bennett F. Automatic generation of some results in finite algebra. Proceedings of International Joint Conference on Artificial Intelligence IJCAI Chambéry, France. 1993;52-59 Morgan Kaufmann.
20. Grama A., Kumar V. State of the art in parallel search techniques for discrete optimization problems. IEEE Transactions on Knowledge and Data Engineering. 11(1):1999;28-35.
21. Habbas Z., Herrmann F., Mérel P.-P., Singer D. Load balancing strategies for parallel forward search algorithm with conflict based backjumping. Proceedings of the 1997 International Conference on Parallel and Distributed Systems (ICPADS'97) Seoul, Korea. 1997;376-381 IEEE Computer Society Press.
22. Karp R.M., Zhang Y. Randomized parallel algorithms for backtrack search and branch-and-bound computation. Journal of the ACM. 40(3):1993;765-789.
23. Knuth D. Estimating the efficiency of backtrack programs. Mathematics of Computation. 29(129):1975;121-136.
24. J.P. Marques-Silva, K.A. Sakallah, Conflict analysis in search algorithms for propositional satisfiability, in: Proceedings of the IEEE International Conference on Tools with Artificial Intelligence, 1996.
25. Massacci F., Marraro L. Logical cryptanalysis as a SAT problem. Journal of Automated Reasoning. 24(1-2):2000;165-203.
26. Meissner M., Hüttner T., Blochinger W., Weber A. Parallel direct volume rendering on PC networks. Arabnia H.R. Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '98) Las Vegas, NV, USA. 1998;CSREA Press.
27. Moskewicz M., Madigan C., Zhao Y., Zhang L., Malik S. Chaff: engineering an efficient SAT solver. Proceedings of the 38th Design Automation Conference (DAC 2001). 2001;530-535 ACM.
28. F. Mueller, On the design and implementation of DSM-threads, in: International Conference on Parallel and Distributed Processing Techniques and Applications, 1997, pp. 315-324.
29. R. Namyst, PM2: an environment for a portable design and an efficient execution of irregular parallel applications, PhD thesis, Univ. de Lille 1, 1997 (in French).
30. K.H. Randall, Cilk: efficient multithreaded computing, PhD thesis, MIT Department of Electrical Engineering and Computer Science, 1998.
31. T. Rühl, H.E. Bal, G. Benson, R.A.F. Bhoedjang, K. Langendoen, Experience with a portability layer for implementing parallel programming systems, in: International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'96) Sunnyvale, CA, 1996, pp. 1477-1488.
32. Skillicorn D.B., Talia D. Models and languages for parallel computing. ACM Computing Surveys. 30:1998;123-169.
33. Tanenbaum A.S., van Steen M. Distributed Systems - Principles and Paradigms. 2002;Prentice-Hall.
34. Woolridge M., Jennings N. Intelligent agents: theory and practice. Knowledge Engineering Review. 10(2):1995.
35. Zhang H. SATO: an efficient propositional prover. Proceedings of 14th International Conference on Automated Deduction (CADE-97). Lecture Notes in Computer Science. vol. 1249:1997;272-275 Springer-Verlag.
36. Zhang H., Bonacina M.P., Hsiang J. PSATO: a distributed propositional prover and its application to quasigroup problems. Journal of Symbolic Computation. 21:1996;543-560.