From Sequential to Parallel Local Search for SAT - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

From Sequential to Parallel Local Search for SAT

Philippe Codognet
  • Fonction : Auteur
  • PersonId : 961571
  • IdRef : 066893607

Résumé

In the domain of propositional Satisfiability Problem (SAT), parallel portfolio-based algorithms have become a standard methodology for both complete and incomplete solvers. In this methodology several algorithms explore the search space in parallel, either independently or cooperatively with some communication between the solvers. We conducted a study of the scalability of several SAT solvers in different application domains (crafted, verification, quasigroups and random instances) when drastically increasing the number of cores in the portfolio, up to 512 cores. Our experiments show that on different problem families the behaviors of different solvers vary greatly. We present an empirical study that suggests that the best sequential solver is not necessary the one with the overall best parallel speedup.
Fichier principal
Vignette du fichier
evocop13.pdf (352.75 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04419667 , version 1 (26-01-2024)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Alejandro Arbelaez, Philippe Codognet. From Sequential to Parallel Local Search for SAT. Evolutionary Computation in Combinatorial Optimization, Apr 2013, Vienna, Australia. pp.157-168, ⟨10.1007/978-3-642-37198-1_14⟩. ⟨hal-04419667⟩
3 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More