Constraint satisfaction is very common in many artificial intelligence applications.
Two essential steps of PAB are studied in more detail to achieve a good performance of the parallel algorithm. Partitioning heuristics to generate independent parts of the overall search space are investigated. Sequential CSP algorithms are compared in order to reveal the most efficient one for QSim. The evaluation of these heuristics and algorithms is based on runtime measurements using CSPs traced from QSim. The comparison of sequential CSP algorithms leads to following strategy for solving partitioned problems.