Difference between revisions of "Painless"

From LRDE

(Source Code)
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
 
PArallel INstantiabLE Sat Solver (Painless) is a framework written in C++ that simplifies the implementation and evaluation of new parallel SAT solvers for many-core environments. The components of Painless can be instantiated independently to produce a new complete solver. The guiding principle is to separate the technical components dedicated to some specific aspect of concurrent programming, from the components implementing heuristics and optimizations embedded in a parallel SAT solver.
 
PArallel INstantiabLE Sat Solver (Painless) is a framework written in C++ that simplifies the implementation and evaluation of new parallel SAT solvers for many-core environments. The components of Painless can be instantiated independently to produce a new complete solver. The guiding principle is to separate the technical components dedicated to some specific aspect of concurrent programming, from the components implementing heuristics and optimizations embedded in a parallel SAT solver.
  
Painless has been developed by the [http://lrde.epita.fr/ LRDE] and the [https://www.lip6.fr/recherche/team.php?id=720 MoVe team] at [https://www.lip6.fr/ LIP6].
+
Painless has been developed by the [http://lrde.epita.fr/ LRDE], the [https://www.lip6.fr/recherche/team.php?acronyme=MoVe MoVe team] at [https://www.lip6.fr/ LIP6], and the [https://www.lip6.fr/recherche/team.php?acronyme=DELYS DELYS team] at [https://www.lip6.fr/ LIP6] / [https://www.inria.fr/ Inria].
  
== Source Code ==
+
== Source Code (GPLv3) ==
 
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
 
[http://www.lrde.epita.fr/dload/painless/painless-v1.zip painless-v1]
  

Revision as of 20:38, 12 June 2019

PArallel INstantiabLE Sat Solver (Painless) is a framework written in C++ that simplifies the implementation and evaluation of new parallel SAT solvers for many-core environments. The components of Painless can be instantiated independently to produce a new complete solver. The guiding principle is to separate the technical components dedicated to some specific aspect of concurrent programming, from the components implementing heuristics and optimizations embedded in a parallel SAT solver.

Painless has been developed by the LRDE, the MoVe team at LIP6, and the DELYS team at LIP6 / Inria.

Source Code (GPLv3)

painless-v1

Awards

Painless-MapleCOMSPS won 1st in the SAT Competition 2018 parallel track!


Painless-MapleCOMSPS won 3rd in the SAT Competition 2017 parallel track!

Related Publications