PaMiraXT: Parallel SAT Solving with Threads and Message Passing
Open Access
- 1 June 2009
- journal article
- Published by SAGE Publications in Journal on Satisfiability, Boolean Modeling and Computation
- Vol. 6 (4) , 203-222
Abstract
This article describes PaMiraXT, a powerful parallel SAT algorithm. PaMiraXT follows a master/client model based on message passing, making it suitable for any kind of workstation cluster. For the clients, MiraXT is used, which itself is thread-basedKeywords
This publication has 6 references indexed in Scilit:
- Parallel propositional satisfiability checking with distributed dynamic learningParallel Computing, 2003
- GRASP: a search algorithm for propositional satisfiabilityIEEE Transactions on Computers, 1999
- A fast parallel SAT-solver — efficient workload balancingAnnals of Mathematics and Artificial Intelligence, 1996
- A high-performance, portable implementation of the MPI message passing interface standardParallel Computing, 1996
- PSATO: a Distributed Propositional Prover and its Application to Quasigroup ProblemsJournal of Symbolic Computation, 1996
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960