ZetaSAT - Boolean SATisfiability solving on Desktop Grids

2005 IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2005

Volumn 2, Issue , 2005, Pages 1079-1086

  Blochinger, Wolfgang ^a   Westje, Wolfgang ^a   Küchlin, Wolfgang ^a   Wedeniwski, Sebastian ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b IBM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DEMODULATION; FAULT TOLERANT COMPUTER SYSTEMS; MEASUREMENT THEORY; PROBLEM SOLVING;

BOOLEAN SATISFIABILITY; DESKTOP GRIDD; DYNAMIC PROBLEM DECOMPOSITION; ZETASAT;

BOOLEAN ALGEBRA;

EID: 33749561549     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2005.1558680     Document Type: Conference Paper

References (33)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Tools and Algorithms for the Analysis and Construction of Systems (TACAS'99), number 1579 in LNCS. Springer-Verlag, 1999.
2. W. Blochinger, W. Küchlin, C. Ludwig, and A. Weber. An object-oriented platform for distributed high-performance Symbolic Computation. Mathematics and Computers in Simulation, 49:161-178, 1999.
3. W. Blochinger, C. Sinz, and W. Küchlin. Parallel consistency checking of automotive product data. In G. R. Joubert, A. Murli, F. J. Peters, and M. Vanneschi, editors, Proc. of the Intl. Conf. ParCo 2001: Parallel Computing-Advances and Current Issues, pages 50-57, Naples, Italy, 2002. Imperial College Press.
4. W. Blochinger, C. Sinz, and W. Küchlin. Parallel prepositional satisfiability checking with distributed dynamic learning. Parallel Computing, 29(7):969-994, 2003.
5. W. Blochinger, C. Sinz, and W. Küchlin. A universal parallel SAT checking kernel. In H. R. Arabnia and Y. Mun, editors, Proc. of the Intl. Conf. on Parallel and Distributed Processing Techniques and Applications PDPTA 03, volume 4, pages 1720-1725, Las Vegas, NV, U.S.A., June 2003. CSREA Press.
6. M. Boehm and E. Speckenmeyer. A fast parallel SAT-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence, 17(3-4):381-400, 1996.
7. Boinc. http://boinc.ssl.berkeley.edu.
8. W. Chrabakh and R. Wolski. GridSAT: A Chaff-based distributed SAT solver for the grid. In Proc. of Supercomputing 03, Phoenix, Arizona, USA, 2003.
9. S. A. Cook. The complexity of theorem proving procedures. In 3rd Symp. on Theory of Computing, pages 151-158. ACM press, 1971.
10. J. M. Crawford and A. B. Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proc. of the Twelfth National Conference on Artificial Intelligence (AAAI-94), volume 2, pages 1092-1097, Seattle, Washington, 1994. AAAI Press/MIT Press.
11. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Communications of the ACM, 5(7):394-397, July 1962.
12. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(3):201-215, 1960.
13. Entropia DCGrid. http://www.entropia.com.
14. N. Eén and N. Sörensson. An extensible SAT-solver. In E. Giunchiglia and A. Tacchella, editors, Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003, volume 2919 of LNCS, pages 502-518, Santa Margherita Ligure, Italy, 2003. Springer Verlag.
15. O. Fedak, C. Germain, V. Nri, and F. Cappello. XtremWeb: A generic global computing system. In IEEE Intl. Symp. on Cluster Computing and the Grid, CCGRID 2001, pages 582-587, Brisbane, Australia, 2001.
16. A. Grama and V. Kumar. State of the an in parallel search techniques for discrete optimization problems. IEEE Transactions on Knowledge and Data Engineering, 11(1):28-35, 1999.
17. United Devices GridMP. http://www.ud.com.
18. J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15(3):359-383, 1995.
19. H. A. Kautz and B. Selman. Planning as satisfiability. In Proc. of the Tenth European Conference on Artificial Intelligence (ECAI'92), pages 359-363, 1992.
20. J. P. Marques-Silva and K. A. Sakallah. Grasp - a new search algorithm for satisfiability. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 220-227,1996.
21. F. Massacci and L. Marraro. Logical cryptanalysis as a SAT problem. Journal of Automated Reasoning, 24(1-2): 165-203, Feb 2000.
22. MetaNEOS. http://www-unix.mcs.anl.gov/metaneos.
23. P. C. Michael O. Neary. Advanced eager scheduling for Java-based adaptive parallel computing. Concurrency and Computation: Practice and Experience, 2004. to appear.
24. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. of the 38th Design Automation Conference, pages 530-535, Las Vegas, 2001.
25. Platform LSF. http://www.platform.com.
26. SAT Competition. http://www.satlive.org/SATCompetition.
27. C. Sinz, W. Blochinger, and W. Küchlin. PaSAT - parallel SAT-checking with lemma exchange: Implementation and applications. In H. Kautz and B. Selman, editors, LICS 2001 Workshop on Theory and Applications of Satisfiability Testing (SAT 2001), volume 9 of Electronic Notes in Discrete Mathematics, Boston, MA, June 2001. Elsevier Science Publishers.
28. P. Stephan, R. K. Brayton, and A. Sangiovanni-Vincentelli. Combinational test pattern generation using satisfiability. IEEE Transactions on Computer-Aided Design, 15(9): 1167-1176, 1996.
29. W. T. Sullivan, D. Werthimer, S. Bowyer, J. Cobb, D. Gedye, and D. Anderson. A new major seti project based on project serendip data and 100,000 personal computers. In In Proc. of the 5th International Conference on Bioastronomy, 1997.
30. M. N. Velev and R. E. Bryant. Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw microprocessors. In Proc. of the 38th Conference on Design Automation Conference, 2001.
31. ZetaGrid. http://www.zetagrid.net.
32. H. Zhang, M. P. Bonacina, and J. Hsiang. PSATO: A distributed prepositional prover and its application to quasigroup problems. Journal of Symbolic Computation, 21:543-560, 1996.
33. L. Zhang and S. Malik. The quest for efficient boolean satisfiability solvers. In Proc. of 8th International Conference on Computer Aided Deduction(CADE 2002), Copenhagen, Denmark, 2002.