HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 :
Conference papers
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02926600
Contributor : Rodrigue Konan Tchinda Connect in order to contact the contributor
Submitted on : Monday, August 31, 2020 - 8:14:05 PM
Last modification on : Wednesday, February 17, 2021 - 8:42:42 PM
Long-term archiving on: : Tuesday, December 1, 2020 - 1:03:00 PM

File

CARI2020-05.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02926600, version 1

Collections

Citation

Rodrigue Konan Tchinda, Clémentin Tayou Djamegni. Parallel Hybridization for SAT: An Efficient Combination of Search Space Splitting and Portfolio. CARI 2020 - African Conference on Research in Computer Science and Applied Mathematics, Oct 2020, Thiès, Senegal. ⟨hal-02926600⟩

Share

Metrics

Record views

34

Files downloads

7