Estimating the Runtime of Parallel SAT Local Search (Extended Abstract)

Abstract : This paper presents a detailed analysis of the scalability and parallelization of local search algorithms for the Satisfiability problem. We propose a framework to estimate the parallel performance of a given algorithm by analyzing the runtime behavior of its sequential version. Indeed, by approximating the runtime distribution of the sequential process with statistical methods, the runtime behavior of the parallel process can be predicted by a model based on order statistics. We apply this approach to study the parallel performance of two SAT local search solvers, namely Sparrow and CCASAT, and compare the predicted performances to the results of an actual experimentation on parallel hardware up to 384 cores. We show that the model is accurate and predicts performance close to the empirical data. Moreover, as we study different types of instances (random and crafted), we observe that the local search solvers exhibit different behaviors and that their runtime distributions can be approximated by two types of distributions: exponential (shifted and non-shifted) and lognormal
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Alejandro Arbelaez <>
Submitted on : Saturday, August 10, 2013 - 10:45:50 AM
Last modification on : Monday, March 4, 2019 - 2:22:27 PM


  • HAL Id : hal-00850975, version 1


Alejandro Arbelaez, Charlotte Truchet, Philippe Codognet. Estimating the Runtime of Parallel SAT Local Search (Extended Abstract). Metaheuristics International Conference (MIC 2013), Aug 2013, Singapore, Singapore. ⟨hal-00850975⟩



Record views