Abstract : Constraint satisfaction and combinatorial optimization problems , even when modeled with efficient metaheurisics such as local search remain computationally very intensive. Solvers stand to benefit significantly from execution on parallel systems, which are increasingly available. The architectural diversity and complexity of the latter means that these systems pose ever greater challenges in order to be effectively used, both from the point of view of the modeling effort and from that of the degree of coverage of the available computing resources. In this article we discuss impositions and design issues for a framework to make efficient use of various parallel architectures.
https://hal-paris1.archives-ouvertes.fr/hal-01195526
Contributor : Danny Munera
<>
Submitted on : Monday, September 7, 2015 - 9:03:43 PM
Last modification on : Friday, September 27, 2019 - 12:16:04 PM
Long-term archiving on : Wednesday, April 26, 2017 - 3:40:00 PM
Salvador Abreu, Danny Munera, Daniel Diaz. Towards a Parallel Hierarchical Adaptive Solver Tool. Workshop on Parallel Methods for Search & Optimization (ParSearchOpt14), Jul 2014, Vienna, Austria. ⟨hal-01195526⟩
