Skip to Main content Skip to Navigation
Journal articles

Deterministic Parallel DPLL

Abstract : Current parallel SAT solvers su er from a non-deterministic behavior. This is the consequence of their architectures which rely on weak synchronizing in an attempt to maximize performance. This behavior is a clear downside for practitioners, who are used to both runtime and solution reproducibility. In this paper, we propose the rst Deterministic Parallel DPLL engine. Our experimental results clearly show that our approach preserves the performance of the parallel portfolio approach while ensuring full reproducibility of the results.
Document type :
Journal articles
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Francois Chevallier Connect in order to contact the contributor
Submitted on : Tuesday, October 1, 2013 - 10:38:19 AM
Last modification on : Friday, February 4, 2022 - 3:13:58 AM
Long-term archiving on: : Monday, January 6, 2014 - 9:31:21 AM


Publisher files allowed on an open archive


  • HAL Id : hal-00868187, version 1



Youssef Hamadi, Said Jabbour, Cédric Piette, Lakhdar Saïs. Deterministic Parallel DPLL. Journal on Satisfiability, Boolean Modeling and Computation, IOS Press, 2011, 7 (4), pp.127-132. ⟨hal-00868187⟩



Record views


Files downloads