Constraint propagation with interval labels
Artificial Intelligence
On the parallel complexity of discrete relaxation in constraint satisfaction networks
Artificial Intelligence
Retire Fortran?: a debate rekindled
Communications of the ACM
Computing Exact Componentwise Bounds on Solutions of Linear Systems with Interval Data isNP-Hard
SIAM Journal on Matrix Analysis and Applications
Cilk: an efficient multithreaded runtime system
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
A conservative scheme for parallel interval narrowing
Information Processing Letters
Intel threading building blocks
Intel threading building blocks
Windows via C/C++
Experiments with massively parallel constraint solving
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
| Hi-index | 0.00 |
Multi-core processors have been broadly available to the public in the last five years. Parallelism has become a common design feature for computational intensive algorithms. In this paper we present a parallel implementation of an algorithm called interval constraint propagation for solution of constraint satisfaction problems over real numbers. Unlike existing implementations of this algorithm, our implementation scales well to many CPU cores with shared memory for sparse constraint satisfaction problems. We present scalability data for a quad-core processor on a number of benchmarks for non-linear constraint solvers.