Experiments in Parallel Constraint-Based Local Search
Experiments in Parallel Constraint-Based Local Search
复制标题
基于并行约束的本地搜索实验
DOI：
10.1007/978-3-642-20364-0_9
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Salvador Abreu
中科院分区：
文献类型：
--
作者：
Y. Caniou;P. Codognet;Daniel Diaz;Salvador Abreu
我们提出了一个基于约束的局部搜索算法的并行实现，并研究其性能的结果与数百个处理器的硬件。我们选择的基本约束求解算法为这些实验的“自适应搜索”的方法，一个有效的顺序局部搜索方法的约束满足问题。实现的算法是一个并行版本的自适应搜索在多个独立行走的方式，即每个进程是一个独立的搜索引擎，并有没有同时计算之间的通信。对各种经典CSP基准测试的初步性能评估表明，对于几十个处理器，加速比非常好，最多几百个处理器。
We present a parallel implementation of a constraint-based local search algorithm and investigate its performance results on hardware with several hundreds of processors. We choose as basic constraint solving algorithm for these experiments the "adaptive search" method, an efficient sequential local search method for Constraint Satisfaction Problems. The implemented algorithm is a parallel version of adaptive search in a multiple independent-walk manner, that is, each process is an independent search engine and there is no communication between the simultaneous computations. Preliminary performance evaluation on a variety of classical CSPs benchmarks shows that speedups are very good for a few tens of processors, and good up to a few hundreds of processors.
DOI：
10.1007/3-540-45322-9
发表时间：
2001-12
期刊：
--
影响因子：
--
作者：
Juraj Hromkovic
通讯作者：
Juraj Hromkovic