by Bernard Jurkowiak, Chu Min Li, Gil Utard
In Proceedings of Workshop on Theory and Applications of Satisfiability Testing (SAT’2001
http://www.laria.u-picardie.fr/~cli/endm9016.ps
Add To MetaCart
Abstract:
We presents the parallelization of Satz using work stealing for workload balancing, based on the master/slave communication model. We dene a simple way to evaluate the workload of every busy slave. The master then steals the rst remaining subtree of the most loaded slave for an idle slave. Special attention is paid to prevent pingpong phenomenon. Our approach easily supports fault tolerance computing and accumulation of intermediate results over time. Encouraging experimental results are presented. Key words: Parallel Search Algorithms, Parallelization of DPLL procedure, SAT
Citations
|
511
|
A machine program for theorem proving
– Davis, Logemann, et al.
- 1962
|
|
341
|
The complexity of theorem proving procedures
– Cook
- 1971
|
|
285
|
Noise strategies for improving local search
– Selman, Kautz, et al.
- 1994
|
|
249
|
and easy distributions of SAT problems
– Hard
- 1992
|
|
181
|
On the complexity of derivations in the propositional calculus
– Tseitin
- 1968
|
|
158
|
Using csp look-back techniques to solve realworl sat instances
– Bayardo, Shrag
- 1997
|
|
122
|
Experimental Results on the Crossover Point in Random 3SAT
– Crawford, Auton
- 1996
|
|
116
|
Towards an understanding of hill-climbing procedures for SAT
– Gent, Walsh
- 1993
|
|
58
|
A new method for solving hard satis problems
– Selman, Levesque, et al.
- 1992
|
|
44
|
SATO: An ecient propositional prover
– Zhang
- 1997
|
|
41
|
Conflict analysis in search algorithms for propositional satisfiability
– Silva, Sakallah
- 1996
|
|
28
|
Psato: a distributed propositional prover and its application to quasigroup problems
– Zhang, Bonacina, et al.
- 1996
|
|
24
|
Parallel Search Algorithms for Discrete Optimization Problems
– Grama, Kumar
- 1995
|
|
17
|
Improvements to propositional satis search algorithms
– Freeman
- 1995
|
|
15
|
A constraint-based approach to narrow search trees for satisfiability
– Li
- 1999
|
|
10
|
Solving the round robin problem using propositional logic
– B'ejar, Many`a
- 2000
|
|
10
|
XtremWeb: Building an Experimental Platform for Global Computing
– Germain, Neri, et al.
|
|
6
|
A fast parallel SATsolver { ecient workload balancing
– Bohm, Speckenmeyer
- 1996
|
|
4
|
Heuristics based on unit propagation for satis problems
– Li
- 1997
|
|
2
|
Pushing the envelope : Planing, propositional logic, and stochastic search
– Kautz, Selman
- 1996
|
