.png){kind=icon}
返回
A Novel Multi-Thread Parallel Constraint Propagation Scheme
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2951027.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Constraint Programming (CP) is an efficient technique for solving combinatorial (optimization) problems. In modern constraint solver, a CP Model is defined over reversible variables that take values in domains and propagators which filter the domains of the variables. Constraint propagation scheme schedules the propagators. A reasonable constraint propagation algorithm can improve the efficiency of solving CP problems. In this paper, we propose two efficient parallel propagation schemes based on multi-thread technique for table constraint. First, we give the formal definition of the parallel consistency and prove that the parallel propagation scheme is equivalent to the classic serial propagation scheme. Then, we propose two parallel propagation schemes: static submission and dynamic submission, which exploit work stealing thread pool and atomic operations to parallelize the classic propagation of table constraint. Finally, extensive experiments on various types of problems show that the two parallel schemes outperform their original serial version on a large number of instances. The results demonstrate the competitiveness of parallel propagation algorithms on solving extensional constraints.
Keyword:
Constraint programming
constraint satisfaction problem
parallel constraint propagation
parallel generalized arc consistency
simple tabular reduction
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
分享收藏Overfitting in protein name recognition on biomedical literature and method of preventing it through use of transductive SVM生物医学文献中蛋白质名称识别任务中的过拟合现象及其通过转导支持向量机（transductive SVM）进行预防的方法
PREAI
分享收藏Diverticular disease increases and effects younger ages: an epidemiological study of 10-year trends
PREAI
分享收藏
没有更多内容
没有更多内容