PaMira - A parallel SAT solver with knowledge sharing

Proceedings - International Workshop on Microprocessor Test and Verification

Volumn , Issue , 2006, Pages 29-34

  Schubert, Tobias ^a   Lewis, Matthew ^a   Becker, Bernd ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

OPTERON PROCESSORS; WORK STEALING METHOD;

KNOWLEDGE ACQUISITION;

EID: 34547792410     PISSN: 15504093     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MTV.2005.17     Document Type: Conference Paper

References (15)

1. M. Böhm and E. Speckenmeyer. A Fast Parallel SAT-Solver - Efficient Workload Balancing. Annals of Mathematics and Artificial Intelligence, 17(3-4):381-400, 1996.
2. A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu. Symbolic Model Checking using SAT Procedures instead of BDDs. In IEEE/ACM Design Automation Conference, 1999.
3. W. Blochinger, C. Sinz, and W. Küchlin. A Universal Parallel SAT Checking Kernel. In International Conference on Parallel and Distributed Processing Techniques and Applications, 2003.
4. M. Davis, G. Logemann, and D. Loveland. A Machine Program for Theorem Proving. Communications of the ACM, 5:394-397, 1962.
5. N. Eén and A. Biere. Effective Preprocessing in SAT through Variable and Clause Elimination. In 8th International Conference on Theory and Applications of Satisfiability Testing, 2005.
6. W Gropp, E. Lusk, N. Doss, and A. Skjellum. A High-Performance, Portable Implementation of the MPI Message Passing Interface Standard. Parallel Computing, 22(6):789-828, 1996.
7. H. Hoos and T. Stützte. SATLIB: An Online Resource for Research on SAT. Frontiers in Artificial Intelligence and Applications, 63:283-292, 2000.
8. B. Jurkowiak, C. Li, and G. Utard. Parallelizing Satz Using Dynamic Workload Balancing. In LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, 2001.
9. R. Lawrence. Efficient Algorithms for Clause-Learning SAT Solvers. Master's thesis, Simon Fraser University, 2004.
10. M. Lewis, T. Schubert, and B. Becker. Speedup Techniques utilized in Modern SAT Solvers - An Analysis in the MIRA Environment. In 8th International Conference on Theory and Applications of Satisfiability Testing, 2005.
11. J. Marques-Silva and K. Sakallah. GRASP - A New Search Algorithm for Satisfiability. In IEEE/ACM International Conference on Computer-Aided Design, 1996.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In IEEE/ACM Design Automation Conference, 2001.
13. C. Sinz, W. Blochinger, and W Küchlin. PaSAT - Parallel SAT-Checking with Lemma Exchange: Implementation and Applications. In LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, 2001.
14. H. Zhang, M. Bonacina, and J. Hsiang. PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems. Journal of Symbolic Computation, 21(4):543-560, 1996.
15. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In IEEE/ACM International Conference on Computer-Aided Design, 2001.