Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study.
Zineb HabbasMichaël KrajeckiDaniel SingerPublished in: Int. J. Comput. Sci. Eng. (2005)
Keyphrases
- shared memory
- constraint satisfaction problems
- decomposition methods
- constraint satisfaction
- distributed memory
- parallel algorithm
- message passing
- parallel computing
- constraint propagation
- parallel programming
- multi processor
- np complete
- constraint programming
- combinatorial problems
- non binary
- arc consistency
- parallel machines
- parallel computers
- search space
- np hard
- address space
- parallel computation
- constraint solving
- parallel architecture
- parallel architectures
- parallel execution
- high resolution
- decomposition method
- shared memory multiprocessors
- message passing interface
- soft constraints
- constraint problems
- multi core processors
- constraint networks
- highly efficient
- commodity hardware
- distributed systems
- dynamic constraint satisfaction problems
- pseudo boolean optimization