Estimating parallel runtimes for randomized algorithms in constraint solving

This paper presents a detailed analysis of the scalability and parallelization of Local Search algorithms for constraint-based and SAT (Boolean satisfiability) solvers. We propose a framework to estimate the parallel performance of a given algorithm by analyzing the runtime behavior of its sequentia...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of heuristics Vol. 22; no. 4; pp. 613 - 648
Main Authors:	Truchet, Charlotte, Arbelaez, Alejandro, Richoux, Florian, Codognet, Philippe
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2016 Springer Nature B.V Springer Verlag
Subjects:	Algorithms Artificial Intelligence Boolean Calculus of Variations and Optimal Control; Optimization Combinatorics Computer Science Distributed, Parallel, and Cluster Computing Estimating techniques Management Science Mathematical analysis Mathematics Mathematics and Statistics Methods Operations Research Operations Research/Decision Theory Parallel processing Performance evaluation Propagation Random variables Studies Parallel processing Performance model Randomized constraint solving Constraint solving
ISSN:	1381-1231, 1572-9397
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!