Cooperation control in Parallel SAT Solving: a Multi-armed Bandit Approach - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Cooperation control in Parallel SAT Solving: a Multi-armed Bandit Approach

Résumé

In recent years, parallel SAT solvers have leveraged with the so-called parallel portfolio architecture, where a set of independent conflict-directed clause learn-ing algorithms compete and cooperate through clause sharing. This architecture however hardly scales up with the number of cores. In this paper, a dynamic multi-armed bandit approach is used to control the communication network (which cores are allowed to send clauses to a given core). The presented approach, referred to as Bandit Ensemble for parallel SAT Solving (BESS), is empirically validated on the recent 2012 SAT challenge benchmark.
Fichier principal
Vignette du fichier
Lazaar2012.pdf (104.44 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00870946 , version 1 (15-11-2022)

Licence

Paternité

Identifiants

  • HAL Id : hal-00870946 , version 1

Citer

Nadjib Lazaar, Said Jabbour, Youssef Hamadi, Michèle Sebag. Cooperation control in Parallel SAT Solving: a Multi-armed Bandit Approach. NIPS 2012 - Workshop on Bayesian Optimization & Decision Making, Dec 2012, Lake Tahoe, United States. ⟨hal-00870946⟩
262 Consultations
58 Téléchargements

Partager

Gmail Facebook X LinkedIn More