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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of heuristics Jg. 22; H. 4; S. 613 - 648
Hauptverfasser:	Truchet, Charlotte, Arbelaez, Alejandro, Richoux, Florian, Codognet, Philippe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2016 Springer Nature B.V Springer Verlag
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!