Lemma Exchange in a Microcontroller Based Parallel SAT Solver

Authors:
Tobias Schubert;Bernd Becker
Affiliations:
Albert-Ludwigs-University of Freiburg;Albert-Ludwigs-University of Freiburg
Venue:
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Year:
2005

Citing 11
Cited 0

PSATO: a distributed propositional prover and its application to quasigroup problems

Journal of Symbolic Computation - Special issue on parallel symbolic computation
GRASP—a new search algorithm for satisfiability

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Accelerating boolean satisfiability through application specific processing

Proceedings of the 14th international symposium on Systems synthesis
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Parallel propositional satisfiability checking with distributed dynamic learning

Parallel Computing
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
PICHAFF2 — A Hierarchical Parallel SAT Solver

MTV '04 Proceedings of the Fifth International Workshop on Microprocessor Test and Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new and more powerful variant of our distributed SAT procedure for Microchip PIC microcontrollers. The algorithm is an adaption of the state-of-theart solver CHAFF optimised for the limited resources of the Microchip processors. It contains features of modern SAT engines like conflict-driven learning and non-chronological backtracking as well as an efficient work stealing method to run several processors in parallel. The underlying hardware environment is a special multiprocessor system based on a PC ISA slot card holding up to 9 PIC microcontrollers. Thereby the communication topology between the computing units can be reconfigured during runtime. In this work we focus on what is sometimes called Lemma Exchange in the literature: the possibility to exchange useful information (conflict clauses / lemmas) between processors working on different parts of the search tree of the same problem instance. Besides technical aspects we also analyse the speedup obtained by Lemma Exchange and describe the effects observed during our experiments.