Name
Abstract | ||
|---|---|---|
A portfolio SAT solver has to share clauses in order to be efficient. In a distributed environment, such sharing implies additional problems: more information has to be exchanged and communications among solvers can be time consuming. In this paper, we propose a new version of the state-of-the-art SAT solver Syrup that is now able to run on distributed architectures. We analyze and compare different programming models of communication. We show that, using a dedicated approach, it is possible to share many clauses without penalizing the solvers. Experiments conducted on SAT 2016 benchmarks with up to 256 cores show that our solver is very effective and outperforms other approaches. This opens a broad range of possibilities to boost parallel solvers needing to share many data. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-66263-3_14 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Discrete mathematics,Programming paradigm,Distributed Computing Environment,Computer science,Boolean satisfiability problem,Parallel computing,Portfolio,Solver | Conference | 10491 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
25 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gilles Audemard | 1 | 640 | 37.66 |
| Jean-Marie Lagniez | 2 | 160 | 26.25 |
| Nicolas Szczepanski | 3 | 3 | 0.72 |
| Sébastien Tabary | 4 | 66 | 6.58 |