The Lock-free state merging in parallel constraint satisfaction problem solver

摘要

Solver state merged in (CSP) solver parallel constraint satisfaction problem. Solver state of processing of the calculation thread of parallel CSP solver, is represented as a support graph of a pair. Merged for each pair, support these graphs, create new, conflict-free graph. Merging process are those with no cycle, contention is removed, threading is a Lock-free. Generally, CSP solver with any formal properties of several (for example, Boolean SAT solver) This architecture can be applied. System that facilitates solve, there is provided a bookkeeping and components for representing as a graph of a set of input solver state calculation thread, of the graph of the set, the system, pairwise input graphs least two and a merge component to the merged graph were combined to represents the final state of the calculation thread.