Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures

13 pages•Published: July 28, 2014

Martin Aigner, Armin Biere, Christoph Kirsch, Aina Niemetz and Mathias Preiner

Abstract

Effectively parallelizing SAT solving is an open and
important issue. The current state-of-the-art is
based on parallel portfolios. This technique relies
on running multiple solvers on the same instance in
parallel. As soon one instance finishes the entire
run stops. Several succesful systems even use plain
parallel portfolio (PPP), where the individual solvers
do not exchange any information. This paper contains
a thorough experimental evaluation which shows that PPP
can improve wall-clock running time because memory access
is still local, respectively the memory system can hide
the latency of memory access. In particular, there does
not seem as much cache congestion as one might imagine.
We also present some limits on the scalibility of PPP.
Thus this paper gives one argument why PPP solvers are a
good fit for todays multi-core architectures.

Keyphrases: multi core sat solving, parallel sat solving, satisfiability

In: Daniel Le Berre (editor). POS-13. Pragmatics of SAT 2013, vol 29, pages 28-40.

Links:	https://easychair.org/publications/paper/nHs
	https://doi.org/10.29007/73n4

BibTeX entry

@inproceedings{POS-13:Analysis_Portfolio_Style_Parallel,
  author    = {Martin Aigner and Armin Biere and Christoph Kirsch and Aina Niemetz and Mathias Preiner},
  title     = {Analysis of Portfolio-Style Parallel SAT Solving on Current Multi-Core Architectures},
  booktitle = {POS-13. Pragmatics of SAT 2013},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {29},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/nHs},
  doi       = {10.29007/73n4},
  pages     = {28-40},
  year      = {2014}}

Download PDF Open PDF in browser