From Parallel SAT to Distributed SAT

1 pages•Published: May 15, 2012

Abstract

This tutorial will present an overview of parallelism in SAT. It will start with a presentation of classical divide and conquer techniques, discuss their ancient origin and compare them to more recent portfolio- based algorithms. It will then present the impact of clause-sharing on their performances and discuss various strategies used to control the communication overhead. A particular technique used to control the classical diversification/intensification tradeoff will also be presented. Finally, perspectives will be given which will relate the current parallel SAT technologies to the expected evolution of computational platforms, leading to distributed SAT solving scenarios.

In: Daniel Le Berre (editor). POS-10. Pragmatics of SAT, vol 8, pages 1.

Links:	https://easychair.org/publications/paper/CHg
	https://doi.org/10.29007/44vf

BibTeX entry

@inproceedings{POS-10:From_Parallel_SAT_Distributed,
  author    = {Youssef Hamadi},
  title     = {From Parallel SAT to Distributed SAT},
  booktitle = {POS-10. Pragmatics of SAT},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {8},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/CHg},
  doi       = {10.29007/44vf},
  pages     = {1},
  year      = {2012}}

Download PDF Open PDF in browser