Massively Parallel Local Search for SAT - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Massively Parallel Local Search for SAT

Philippe Codognet
  • Function : Author
  • PersonId : 961571
  • IdRef : 066893607

Abstract

Parallel portfolio-based algorithms have become a standard methodology for both complete and incomplete solvers for SAT solving. In this methodology several algorithms explore the search space in parallel, either independently or cooperatively with some communication between the solvers. Unlike previous work where parallel algorithms are limited to few cores (usually up to 16 cores), this work studies the performance of parallel local search for SAT with a large degree of parallelism, up to 256 cores, and compares various cooperation strategies. The strategy with the best performance consists in considering small groups of solvers (e.g. 4 or 8) sharing information and performing no inter-group communication.

Keywords

Fichier principal
Vignette du fichier
ICTAI_2012.pdf (427.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04416469 , version 1 (25-01-2024)

Licence

Copyright

Identifiers

Cite

Alejandro Arbelaez, Philippe Codognet. Massively Parallel Local Search for SAT. 2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012), Nov 2012, Athens, France. pp.57-64, ⟨10.1109/ICTAI.2012.17⟩. ⟨hal-04416469⟩
14 View
11 Download

Altmetric

Share

Gmail Facebook X LinkedIn More