Skip to Main content Skip to Navigation
Journal articles

Parallel Hybridization for SAT: An Efficient Combination of Search Space Splitting and Portfolio

Abstract : Search space splitting and portfolio are the two main approaches used in parallel SAT solving. Each of them has its strengths but also, its weaknesses. Decomposition in search space splitting can help improve speedup on satisfiable instances while competition in portfolio increases robustness. Many parallel hybrid approaches have been proposed in the literature but most of them still cope with load balancing issues that are the cause of a non-negligible overhead. In this paper, we describe a new parallel hybridization scheme based on both search space splitting and portfolio that does not require the use of load balancing mechanisms (such as dynamic work stealing).
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02926523
Contributor : Rodrigue KONAN TCHINDA Connect in order to contact the contributor
Submitted on : Wednesday, February 17, 2021 - 8:34:22 PM
Last modification on : Sunday, February 28, 2021 - 8:31:55 PM

File

ARIMA_FINAL_Parallel_Hybridiza...
Files produced by the author(s)

Identifiers

Collections

Citation

Rodrigue Konan Tchinda, Clémentin Tayou Djamegni. Parallel Hybridization for SAT: An Efficient Combination of Search Space Splitting and Portfolio. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2021, Volume 34 - 2020 - Special Issue CARI 2020, ⟨10.46298/arima.6750⟩. ⟨hal-02926523v2⟩

Share

Metrics

Record views

82

Files downloads

284