Using Parallel Singleton Arc Consistency to Enhance Constraint Solving
Using Parallel Singleton Arc Consistency to Enhance Constraint Solving
复制标题
使用并行单例弧一致性来增强约束求解
DOI：
10.1109/ictai.2015.17
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
N. Gharbi
中科院分区：
文献类型：
--
作者：
N. Gharbi
近年来，随着多核计算世界的进步，约束编程社区试图从新机器的能力中受益，并通过几种并行方案来最大限度地利用它们来求解约束。在本文中，我们提出了一种新的方法，使用并行迭代来增强经典的求解过程。具体来说，我们提出了一种方法，其中主进程试图解决约束满足问题，同时使用辅助工人所做的一致性测试的结果，以避免一些无用的分支。
In the latest years and with the advancements of the multicore computing world, the constraint programming community tried to benefit from the capacity of new machines and make the best use of them through several parallel schemes for constraint solving. In this paper, we present a new approach using parallel consistencies to enhance the classical solving process. Specifically, we propose an approach where a master process tries to solve a constraint satisfaction problem while using the results of consistency tests done by auxiliary workers so as to avoid some useless branching.