There is an extended stream of work exploiting parallelism in CP. One often cited work in parallel search integrated in a constraint solver is that of Perron [13], [12]. New states are entered using re-computation and a communication layer is responsible for load balancing and termination detection.The presented results are rather modest and in a small-scale (up to 4 workers).