As a result of the considerable recent advances in parallel constraint solving, a number of quite efficient parallel CP and SAT solvers have been developed. Parallel constraint solving techniques are roughly divided in search space splitting and portfolio-based ones. In this talk we describe a novel scheme for developing a parallel CP (or SAT) solver through the exploitation of strong propagation methods. This scheme is orthogonal to the two general categories of parallelization methods and it is presented as a search algorithm consisting of a main process, which is a typical CP (or SAT) solver, aided by a number of coworkers running in parallel.